-
This is the second solution to find all the strings with no vowels, in a given file. This approach uses the FileReader, Scanner, StringTokenizer, and Pattern class of Java regular expressions.
-
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.
-
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.
-
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.
-
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.
-
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.
-
This is the first solution to reverse all the numbers. This solution modifies the same array. The resultant array has all the numbers reversed.
-
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.
-
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.
-
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.
Java Ice Breakers 