We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Strings
  4. Java Anagrams
  5. Discussions

Java Anagrams

  • princeanand
     + 0 comments

    This is my Soln -

    (kind of brute forcing my way , I know there can by more optimized soln but this came to mind 🥲😑 )

    static boolean isAnagram(String a, String b) {
        
        char [] a1 = a.toLowerCase().toCharArray();
        char [] a2 = b.toLowerCase().toCharArray();
        if (a1.length==a2.length){
            for (int i=0;i<a1.length;i++){
                if ((b.toLowerCase()).contains(a1[i]+"")){
                int ind = b.toLowerCase().indexOf(a1[i]);
                int count1 = 0;
                int count2 = 0;
                for (int j=0;j<a2.length;j++){
                    if (a1[i]==a1[j]){
                        count1++;
                    }
                    if (a2[ind]==a2[j]){
                        count2++;
                    }
                }
                if (count1!=count2){
                    return false;
                }
                }
                else{
                    return false;
                }
            }
            return true;
        }
        else{
            return false;
        }
    }