2. Verify if a all the characters in string1 are available in string2() (String Anagram)
Sigiloso
public class Anagram { //O(N) public String anagram_bitCalculation(String s1, String s2) { if (s1.length() != s2.length()) return "NO"; int value = 0; for (int i = 0; i < s1.length(); i++) { value = value ^ (int) s1.charAt(i); value = value ^ (int) s2.charAt(i); } if (value == 0) return "YES"; return "NO"; } public static void main(String args[]) { Anagram a = new Anagram(); Scanner sc = new Scanner(System.in); String[] words = new String[sc.nextInt()]; sc.nextLine(); for (int i = 0; i < words.length; i++) { words[i] = sc.nextLine(); } for (String word : words) { String str1 = word.split(" ")[0]; String str2 = word.split(" ")[1]; System.out.println(a.anagram_bitCalculation(str1, str2)); } }