{"id":11031,"date":"2022-12-13T06:56:54","date_gmt":"2022-12-13T06:56:54","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=11031"},"modified":"2022-12-27T07:46:29","modified_gmt":"2022-12-27T07:46:29","slug":"anagram-program-in-java","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/anagram-program-in-java\/","title":{"rendered":"Anagram Program in Java"},"content":{"rendered":"

\"\"<\/p>\n

We will learn how to determine whether two strings are anagrams in this post. A word or phrase created by rearranging the letters of another word is known as an anagram. Two strings are input by the user. Each letter (from ‘a’ to ‘z’) must be counted in order for us to compare the matching numbers. The number of times an alphabet appears in a string is its frequency. We may claim that two strings are anagrams if they both include the same number of instances of a certain alphabet.<\/p>\n

What is Anagram in Java?<\/h2>\n

Anagrams are strings that have the exact same characters in them but are arranged differently.
\nFor example :<\/strong><\/p>\n

    \n
  1. "now"<\/strong> and "own"<\/strong> <\/li>\n
  2. "ton"<\/strong> and "not"<\/strong><\/li>\n
  3. "fiber"<\/strong> and "brief"<\/strong><\/li>\n<\/ol>\n

    Below is a demonstration of the same \u2212
    \nInput<\/strong>
    \nSuppose our input is \u2212
    \nEnter the first string: Race
    \nEnter the second string: Care
    \nOutput<\/strong>
    \nThe desired output would be \u2212
    \nThe strings race and care are anagrams.<\/p>\n

    \"\"<\/p>\n

    Anagram Program Algorithm:<\/h2>\n
      \n
    • START<\/li>\n
    • Declare two string values namely my_string_1, my_string_2<\/li>\n
    • Read the required values from the user\/ define the values<\/li>\n
    • Convert both the strings to lowercase letters using the toLowerCase() function<\/li>\n
    • Check if the length of the two strings is the same, if not, they are not anagram strings.<\/li>\n
    • Assign the strings to character arrays and sort them.<\/li>\n
    • Use the function \u2018equals()\u2019 to check if they are equal. If yes, they are anagram strings, else they are not anagram strings.<\/li>\n
    • Display the result<\/li>\n
    • Stop<\/li>\n<\/ul>\n

      Java Anagram Program Code<\/h2>\n

      We can write Anagram program in Java by using the following methods<\/p>\n

      Method 1: Pseudo Code for Anagram Program in java using sort() and equals() method:<\/h3>\n
        \n
      1. Remove all white spaces from the two strings and convert them to uppercase.<\/li>\n
      2. Use toCharArray() to turn the two strings into char arrays.<\/li>\n
      3. Sort the two character arrays using sort() method of java.util.Arrays class.<\/li>\n
      4. Using the equals() function, we compare the two arrays after sorting.<\/li>\n<\/ol>\n

        Code Implementation:<\/strong>
        \n\t\t\t\t\t\t