Question

Anagram Detector Due by Friday 12 April 2019 11:59 PM Program Overview: This program will be able to determine if two inputted texts are anagrams of one another. Relevant Details and Formulas: An anagram of a text is a rearrangement of the letters such that it forms another, usually intelligible, set of words. Capitalization is not important and any white space, punctuation, or other non-letter symbols should be ignored. Program Specification: * Prompt the user for a pair of text lines and use read ("(A)") to read in each input text. o Track each string separately using two different arrays. o If they are the same, an anagram has been detected. . Count the number of each letter in the two strings. Compare the two counts of the individual letters. o Otherwise, they are not anagrams of one another. Inform the user on whether the two strings are anagrams or not. Things to note and helpful hints If you need some examples of anagrams, try this website: http://www.fun-with-words.com/anag_ short_long.html The read statement with an unspecified character length will try to fill the character variable with as much input as is available. With a sufficiently large character variable, 1000 characters for example, will suffice to get the input text from the user.

Answer 1

Hi,

Please find the below code.

There are comments on respective lines of code. These comments are used to understand the flow of the program.

// Program to check whether two strings are anagrams of each other or not.
import java.io.*;
import java.util.*;

class Anagram{

   static int number_of_chars = 256;

   // function to check whether two strings are anagram of each other
   static boolean check(char s1[], char s2[])
   {
       // Create 2 count arrays and initialize all values as 0
       int count1[] = new int[number_of_chars];
       Arrays.fill(count1, 0);
       int count2[] = new int[number_of_chars];
       Arrays.fill(count2, 0);
       int i;

       // For every character in input strings, increment the count in the corresponding count array
       for (i = 0; i < str1.length && i < str2.length;
           i++) {
           count1[s1[i]]++;
           count2[s2[i]]++;
       }

       // If both strings are of different length then they are not called as anagrams.
      
       if (s1.length != s2.length)
           return false;

       // Compare count arrays
       for (i = 0; i < number_of_chars; i++)
           if (count1[i] != count2[i])
               return false;

       return true;
   }

  
   public static void main(String args[])
   {
       Scanner sc=new Scanner(System.in);
       System.out.println("Enter Text1:");
       String text1=sc.nextLine();
       System.out.println("Enter Text2:");
       String text2=sc.nextLine();
       System.out.println("Text 1:"+text1);
       System.out.println("Text 2:"+text2);
       char str1[] = text1.toCharArray();
       char str2[] = text2.toCharArray();

       if (check(str1, str2)) //calling the check method to check whether the two strings are anagrams or not.
           System.out.println("Anagram Found");
       else
           System.out.println("Anagram Not Found");
   }
}

Hope this answers your question. If you liked the answer please give thumbs up and if you have any questions please ask in the comment section, I will try to solve them. Thank you.