Question

To be done in java code. 2 words are anagrams if 1 word can be formed by rearranging all the letters of the other word, eg: mary, army a word is represented as a linked list with one letter per node of the list.

Write a function that, given w1 and w2, with each pointing to a word of lowercase letters, returns 1 if the words are anagrams and 0 if they are not. Base your algorithm on the following: for each letter in w1, search w2 for it; if found, delete it and continue; otherwise, return 0.

Answer 1

public class Angagram {
   public static void main(String[] args) {
       int s=anagram("mean","name");
       System.out.println(s);
   }

   private static int anagram(String w1, String w2) {
       w1=w1.toLowerCase();
       w2=w2.toLowerCase();
       StringBuffer sb = new StringBuffer(w2);
       for(int i=0;i<w1.length();i++) {
           if(sb.indexOf(w1.charAt(i)+"")!=-1) {
               sb.deleteCharAt(sb.indexOf(w1.charAt(i)+""));
           }
           else {
               return 0;
           }
              
       }
       return (sb.length()==0)?1:0;
   }
  
}

Note : Please comment below if you have concerns. I am here to help you

If you like my answer please rate and help me it is very Imp for me