// How do I apply Unit Test into all the methods in this package //and run it on a class named UnitestingStringProlem //The pictures are the classes that has to be tested.  package string.problems; public class UnitTestingStringProblem { public static void main(String[] args) { //Apply Unit Test into all the methods in this package. } }

package string.problems; A2 ^ v import java.util.Arrays; public class Anagram { public static void main(String[] args) { //Write a Java Program to check if the two String are Anagram. Two String are called Anagram when there : //same character but in different order. For example, "CAT" and "ACT", "ARMY" and "MARY". String firstString = "CAT"; String secondString = "ACT"; char str1[] = firstString.toCharArray(); char str2[] = secondString.toCharArray(); Arrays.sort(str1); Arrays.sort(str2); String s1 = new String(str1); String s2 = new String(str2); if(s1.equals(s2)){ System.out.println("Strings are anagram"); } else{ System.out.println("Strings are not anagram"); Recommended plugin available for dependency java:Com.google.protobuf:protobuf-java. Configure plugins... Do not suggest this plugin Terminal Build Dependencies pogle.protobuf:protobuf-java'. // Configure plugins... // Do not suggest this plugin (20 minutes ago) 3 Event Log 7:24 CRLF UTF-8 4 spaces P master 1 package string problems; import java.util.HashMap; import java.util. Map; public class DetermineLargestWord { /* Implement to Find the length and longest word in the given sentence below. Should return "10 biological". * public static Map findTheLargestWord(String wordGiven) { Map map = new HashMap(); String words[] = wordGiven.split( regex: " "); String maxWord = words[0]; for (int i = 1; i maxWord.length()) { maxWord = words[i]; } } map.put(maxWord.length(), maxWord); 0 Recommended plu return map; "java:com.google.pro } Configure plugins... - > Terminal Build Dependencies ng DD.JO DD.Java Determine Dupicdlev package string.problems; Pimport java.util.HashMap; import java.util.Map; public class DuplicateWord { - public static HashMap duplicateElement(String source){ HashMap hash = new HashMap(); String [] words = source.split( regex: "|\s+"); for(String x:words) { if(x.contains(".")){ x=x.replace( target: "." replacement: ""); x = x.toLowerCase(); } if(hash.containskey(x)){ hash.put(x, hash.get(x)+1); }else{ hash.put(x, 1); } } Il hash.entrySet().removeIf(x-> (1==x.getValue()); return hash; Recommended plugin available for deper } java:com.google.protobuf:protobuf-java Configure plugins... Do not suggest thi // TODO secondly we wrote a function to get the average length of woras used in the string given Dependencies > Terminal Build A1 x 1 public class Palindrome { public static void main(String[] args) { /* If a String is reversed and it remains unchanged, that is called Palindrome. For example, MOM, DAD, I Palindrome. So write java code to check if a given String is Palindrome or not. * - String stri, str2=""; //initialize strings Scanner sc=new Scanner(System.in); System.out.println("Type a word to see if is palindrome or not palindrome: "); str1= sc.nextLine(); int i, n= stri.length(); for(i=n-1; i>=0; i--) { str2= str2+ str1.charAt(i); //reversing the string } if(str1.equalsIgnorecase(str2)) //checking the strings { System.out.println("The String is palindrome"); } else Recommended plugin available for dependency { 'java:com.google.protobuf:protobuf-java. System.out.println("The String is not palindrome"); Configure plugins... Do not suggest this plugin . Terminal Build Dependencies 3 Even public class Permutation { public static void main(String[] args) { /* * Permutation of String "ABC" is "ABC" "BAC" "BCA" "ACB" "CAB" "CBA". * Write Java program to compute all Permutation of a String * * Scanner sc= new Scanner(System.in); //System.in is a standard input stream System.out.print("Enter a string: "); String str= sc.nextLine(); System.out.println("The permutation of the given string are :"); find_permutations(str, res: ""); } static void find_permutations (String str, String res){ if (str.length() == 0){ System.out.print(res "); return; } boolean flag[] = new boolean[26]; 0 Recommended plugin available f for (int i = 0; i