classSolution{publicbooleanisAnagram(String s,String t){if(s.length()!= t.length()){returnfalse;}int[] arr =newint[26];for(int i =0; i < s.length(); i++){
arr[s.charAt(i)-'a']+=1;}for(int i =0; i < t.length(); i++){
arr[t.charAt(i)-'a']-=1;}for(int i =0; i < arr.length; i++){if(arr[i]!=0){returnfalse;}}returntrue;}}
classSolution{publicint[]intersection(int[] nums1,int[] nums2){Set<Integer> set =newHashSet<>();Set<Integer> resSet =newHashSet<>();for(int i =0; i < nums1.length; i++){
set.add(nums1[i]);}for(int i =0; i < nums2.length; i++){if(set.contains(nums2[i])){
resSet.add(nums2[i]);}}return resSet.stream().mapToInt(item -> item).toArray();}}
classSolution{publicbooleanisHappy(int n){Set<Integer> set =newHashSet<>();while(n !=1&&!set.contains(n)){
set.add(n);
n =nextNumber(n);}return n ==1;}privateintnextNumber(int n){int res =0;while(n >0){int temp = n %10;
res += temp * temp;
n = n /10;}return res;}}