Tag: Oracle Certified Associate Java SE8
-
How to count number of occurrences of a given word in a file
This is the second solution to count the number of occurrences of a given string in the file. This approach uses the FileReader, Scanner, and String class methods.
-
How to find and replace a given string with new string in a file
This is the second solution to find and replace a given string with a new string in a file. This approach uses the FileReader, Scanner, FileWriter, BufferedWriter, and String methods.
-
How to count number of lines, words and characters in a file
This is the first solution to count number of lines, words and characters in a given file. This approach uses the FileReader, BufferedReader, StringTokenizer and String methods.
-
How to find strings with no vowels in a file
This is the first solution to find all the strings with no vowels, in a given file. This approach uses the FileReader, BufferedReader, StringTokenizer and StringBuffer methods.
-
How to find and replace a given string with new string in a file
This is the first solution to find and replace a given string with a new string in a file. This approach uses the FileReader, BufferedReader, FileWriter, BufferedWriter, and StringBuffer methods.
-
How to reverse all the numbers in an array of integers
This is the first solution to reverse all the numbers. This solution modifies the same array. The resultant array has all the numbers reversed.
-
How to count number of occurrences of a given word in a file
This is the first solution to count the number of occurrences of a given word in the file. This approach uses the FileReader, BufferedReader, and string buffer methods.
-
How to check a string can be eligible to form a palindrome
This is the third solution to check whether a string can be formed as a palindrome. This approach uses the eliminating the repeated characters from the input string using the String Buffer class.
-
How to check a string can be eligible to form a palindrome
This is the second solution to check whether a string can be formed as a palindrome. This approach uses the eliminating the repeated characters from the input string using the Hash map collection.
-
How to check a string can be eligible to form a palindrome
This is the first solution to check whether a string can be formed as a palindrome. This approach uses the core logic to check the criteria for the palindrome.
Java Ice Breakers 