Tag: IZ0-809 OCP Java Programmer 2
-
How to remove duplicate numbers in an Array of integers
This is the first solution to remove the duplicate numbers from an Array of integers. This program takes the temporary array to store the numbers after removing the duplicates.
-
How to reverse each word in a sentence without using reverse method
This is the second solution to to reverse each word in the given input line of strings. This program uses the core logic to reverse each string.
-
How to reverse each word in a sentence using StringBuffer class
This is the first solution to to reverse each word in the given input line of strings. This program uses the built in reverse method of StringBuffer class.
-
How to find the duplicate words in a sentence using Collections class
Find the duplicate words in a given sentence of strings using the frequency method of the Collections class. This is the third possible solution to solve this problem.
-
How to find the duplicate words in a sentence using HashMap
This is the second solution to identify the duplicate words in a given input sentence of strings, using the HashMap methods.
-
How to find the duplicate words in a sentence of strings
This is the first solution to identify the duplicate words in a given input sentence of strings, using the core logic.
-
How to find the minimum and maximum length strings in a sentence of strings using HashMap
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.
-
How to find the minimum and maximum length strings in a sentence of strings
This is the first solution to find the maximum and minimum length strings from a given input sentence of strings, using the core logic.
-
How to find the triplet numbers from an array whose sum is divisible by 9
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.
-
How to find the pairs of numbers from an array whose sum is 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.
Java Ice Breakers 