Add anagrams (TheAlgorithms#2859)

Co-authored-by: Andrii Siriak <[email protected]>

Author: siddhant2002

src/main/java/com/thealgorithms/strings/Anagrams.java

@@ -0,0 +1,150 @@
+/** Author : Siddhant Swarup Mallick
+ * Github : https://github.com/siddhant2002
+ */
+
+/** PROBLEM DESCRIPTION :
+ * An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.[1] For example, the word anagram itself can be rearranged into nag a ram, also the word binary into brainy and the word adobe into abode. Reference from https://en.wikipedia.org/wiki/Anagram
+ */
+
+package com.thealgorithms.strings;
+import java.util.*;
+public class Anagrams 
+{
+    // 4 approaches are provided for anagram checking. approach 2 and approach 3 are similar but differ in running time.
+    public static void main(String args[]) {
+        String first = "deal";
+        String second = "lead";
+        // All the below methods takes input but doesn't return any output to the main method.
+        Anagrams nm=new Anagrams();
+        System.out.println(nm.approach2(first, second));  /* To activate methods for different approaches*/
+        System.out.println(nm.approach1(first, second));  /* To activate methods for different approaches*/
+        System.out.println(nm.approach3(first, second));  /* To activate methods for different approaches*/
+        System.out.println(nm.approach4(first, second));  /* To activate methods for different approaches*/
+
+        /**
+         * OUTPUT :
+         * first string ="deal" second string ="lead"
+         * Output: Anagram
+         * Input and output is constant for all four approaches
+         * 1st approach Time Complexity : O(n logn)
+         * Auxiliary Space Complexity : O(1)
+         * 2nd approach Time Complexity : O(n)
+         * Auxiliary Space Complexity : O(1)
+         * 3rd approach Time Complexity : O(n)
+         * Auxiliary Space Complexity : O(1)
+         * 4th approach Time Complexity : O(n)
+         * Auxiliary Space Complexity : O(n)
+         */
+    }
+
+    boolean approach1(String s, String t) 
+    {
+        if (s.length() != t.length())
+        {
+            return false;
+        }
+        else 
+        {
+            char c[] = s.toCharArray();
+            char d[] = t.toCharArray();
+            Arrays.sort(c);
+            Arrays.sort(d);    /* In this approach the strings are stored in the character arrays and both the arrays are sorted. After that both the arrays are compared for checking anangram */
+            if (Arrays.equals(c, d)) 
+            {
+                return true;
+            } else 
+            {
+                return false;
+            }
+        }
+    }
+
+    boolean approach2(String a, String b)
+    {
+        if(a.length()!=b.length())
+        {
+            return false;
+        }
+        else
+        {
+            int m[]=new int[26];
+            int n[]=new int[26];
+            for(char c: a.toCharArray())
+            {
+                m[c-'a']++;
+            }
+            // In this approach the frequency of both the strings are stored and after that the frequencies are iterated from 0 to 26(from 'a' to 'z' ). If the frequencies match then anagram message is displayed in the form of boolean format
+            // Running time and space complexity of this algo is less as compared to others
+            for(char c:b.toCharArray())
+            {
+                n[c-'a']++;
+            }
+            for(int i=0;i<26;i++)
+            {
+                if(m[i]!=n[i])
+                {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+
+    boolean approach3(String s, String t)
+    {
+        if(s.length()!=t.length())
+        {
+            return false;
+        }
+        // this is similar to approach number 2 but here the string is not converted to character array
+        else
+        {
+            int a[]=new int[26];
+            int b[]=new int[26];
+            int k=s.length();
+            for(int i=0;i<k;i++)
+            {
+                a[s.charAt(i)-'a']++;
+                b[t.charAt(i)-'a']++;
+            }
+            for(int i=0;i<26;i++)
+            {
+                if(a[i]!=b[i])
+                    return false;
+            }
+            return true;
+        }
+    }
+
+    boolean approach4(String s, String t)
+    {
+        if(s.length()!=t.length())
+        {
+             return false;
+        }
+        // This approach is done using hashmap where frequencies are stored and checked iteratively and if all the frequencies of first string match with the second string then anagram message is displayed in boolean format
+        else
+        {
+            HashMap<Character,Integer> nm=new HashMap<>(); 
+            HashMap<Character,Integer> kk=new HashMap<>();
+            for(char c: s.toCharArray())
+            {
+                nm.put(c, nm.getOrDefault(c,0)+1);
+            }
+            for(char c: t.toCharArray())
+            {
+            
+                kk.put(c, kk.getOrDefault(c,0)+1);
+            }
+            // It checks for equal frequencies
+            for(char c:nm.keySet())
+            {
+                if(!nm.get(c).equals(kk.get(c)))
+                {
+                    return false;
+                }
+            } 
+            return true;
+        }
+    }
+}