-
This is the second solution to find the maximum length and minimum length strings from a given input sentence of strings, using the HashMap methods.
-
This is the first solution to find the maximum and minimum length strings from a given input sentence of strings, using the core logic.
-
This is the first solution to find the triplet of numbers in which their sum is divisible by 9 from an array of integers. This method uses the core logic of traversing array using nested for loop, add any three successive numbers in each iteration, and then verify that sum divisible by 9.
-
This is the first solution to find the pairs of numbers in which their sum is divisible by 9 from an array of integers. This method uses the core logic of traversing array using nested for loops, add any two numbers in each iteration, and then verify that the sum is divisible by 9.
-
This is the first solution to find the length of all the integers given during input. This program uses the HashMap collection to store the integer values and it’s respective length as key value pairs.
-
This is the first solution to find whether the given integer number is prime or not using the core logic, that is to check the divisibility of that number until the square root of that number.
-
This is the first solution to find the sum of integers in an array, using the core logic.
-
This is the fourth solution to find the first and second biggest numbers from the given ArrayList of integers, using Collections class.
-
This is the third solution to find the biggest number from the given array of integers, using stream method of Arrays class. This stream uses filter(0, max(), and getAsInt() methods.
