Task - String Programs - Anagrams

[akash-coded]

He Who Must Not Be Named

Two strings are called anagrams if they contain the same set of characters but in a different order.
Example: keep, peek

Write a Java program to check whether two strings are anagram or not.
The program takes the following two strings as inputs and finds out whether they are anagrams of each other.

String str1 = "Tom Marvolo Riddle";
String str2 = "I am Lord Voldemort";

If the strings are anagrams of each other, print the count of unique characters in either of them.

[nikhil95301]

import java.util.Scanner;

public class Anagram {
public static void main(String[] args) {
String s1, s2;
Scanner sc = new Scanner(System.in);
s1 = sc.nextLine();
s2 = sc.nextLine();
s1.toLowerCase();
s2.toLowerCase();
int ar1[] = new int[26], ar2[] = new int[26];
for (int i = 0; i < 26; i++) {
ar1[i] = 0;
ar2[i] = 0;
}
for (int i = 0; i < s1.length(); i++)
ar1[s1.charAt(i) - 'a']++;

    for (int i = 0; i < s2.length(); i++)
        ar2[s2.charAt(i) - 'a']++;
    int c = 1;
    for (int i = 0; i < 26; i++)
        if (ar1[i] != ar2[i])
            c = 0;
    if (c == 1)
        System.out.println("Anagram");
    else
        System.out.println("Not Anagram");

  
}

}

[RohitNaikade1]

package Strings;

import java.util.*;

public class Anagrams {
    public static void main(String[] args) {
        String str1 = "Tom Marvolo Riddle".toLowerCase();
        String str2 = "I am Lord Voldemort".toLowerCase();
        HashMap<Character, Integer> map = new HashMap<Character, Integer>();
        boolean flag = true;

        if (str1.length() != str2.length()) {
            flag = false;
        } else {
            for (int i = 0; i < str1.length(); i++) {
                if (map.containsKey(str1.charAt(i))) {
                    map.put(str1.charAt(i), map.get(str1.charAt(i)) + 1);
                } else {
                    map.put(str1.charAt(i), 1);
                }
            }

            for (int i = 0; i < str2.length(); i++) {
                if (map.containsKey(str1.charAt(i))) {
                    map.put(str1.charAt(i), map.get(str1.charAt(i)) - 1);
                } else {
                    flag = false;
                    break;
                }
            }
            for (Character ch : map.keySet()) {
                if (map.get(ch) != 0) {
                    flag = false;
                    break;
                }
            }
        }

        if (flag == false) {
            System.out.println("Stirngs are not an Anagrams");
        }else{
            System.out.println("Strings are Anagrams");
        }

    }
}

[Gaurav-Joshi-31]

public class Anagram {
    static boolean areAnagrams(String a, String b) {
        a = a.replace(" ", "").toLowerCase();
        b = b.replace(" ", "").toLowerCase();

        if (a.length() != b.length())
            return false;
        int[] arr = new int[26];
        for (int i = 0; i < a.length(); i++)
            arr[a.charAt(i) - 97]++;

        for (int i = 0; i < b.length(); i++)
            arr[b.charAt(i) - 97]--;

        for (int s : arr) {
            if (s != 0)
                return false;
        }
        return true;
    }

    public static void main(String[] args) {
        String a = "Tom Marvolo Riddle";
        String b = "I am Lord Voldemort";
        System.out.println(areAnagrams(a, b));
    }
}

[Sarfinaa]

public class Anagram {
    public static boolean isAnagram(String str1, String str2) {
        str1 = str1.replace(" ", "").toLowerCase();
        str2 = str2.replace(" ", "").toLowerCase();
        if (str1.length() != str2.length())
            return false;
        int[] hash = new int[26];
        for (int i = 0; i < str1.length(); i++) {
            hash[str1.charAt(i) - 'a']++;
            hash[str2.charAt(i) - 'a']--;
        }
        for (int i = 0; i < hash.length; i++) {
            if (hash[i] != 0) {
                return false;
            }
        }
        return true;
    }

    public static void main(String[] args) {
        String str1 = "Tom Marvolo Riddle";
        String str2 = "I am Lord Voldemort";
        System.out.println(isAnagram(str1, str2));
    }
}

[preeti-max]

`package StringOperations;
import java.util.Arrays;
import java.util.Scanner;

public class Anagram {
public static boolean isAnagram(String s1,String s2){

    s1=s1.replace(" ","");
    s2=s2.replace(" ","");
    if(s1.length()!=s2.length()){
        return false;
    }
    char c1[]=s1.toUpperCase().toCharArray();
    char c2[]=s2.toUpperCase().toCharArray();
    Arrays.sort(c1);
    Arrays.sort(c2);
    return Arrays.equals(c1, c2);

}

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);

String str1 = sc.nextLine();
String str2 = sc.nextLine();
System.out.println(isAnagram(str1,str2)?"They are anagram":"They are not anagram");

}
}
`

[Shubhi27]

package session14;

public class Anagram {
    public static boolean isAnagram(String a, String b) {
        a = a.replace(" ", "").toLowerCase();
        b = b.replace(" ", "").toLowerCase();
        int arr[] = new int[256];
        if (a.length() != b.length()) {
            return false;
        }
        for (int i = 0; i < a.length(); i++) {
            int c1 = (int) a.charAt(i);
            int c2 = (int) b.charAt(i);
            arr[c1]++;
            arr[c2]--;
        }

        for (int i = 0; i < 256; i++) {
            if (arr[i] != 0) {
                return false;
            }
        }
        return true;

    }

    public static void main(String[] args) {
        String a = "Tom Marvolo Riddle";
        String b = "I am Lord Voldemort";
        System.out.println(isAnagram(a, b));
    }
}

[amruth2211]

`package Week4;

import java.util.Scanner;
import java.util.Arrays;

public class Anagram {

public static boolean isAnagram(String s1, String s2) {
    s1 = s1.replace(" ", "").toLowerCase();
    s2 = s2.replace(" ", "").toLowerCase();
    boolean flag = true;
    if (s1.length() != s2.length()) {
        flag = false;
    } else {
        char[] c1 = s1.toLowerCase().toCharArray();
        char[] c2 = s2.toLowerCase().toCharArray();
        Arrays.sort(c1);
        Arrays.sort(c2);
        flag = Arrays.equals(c1, c2);
    }
    return flag;

}

public static void main(String[] args) {
    Scanner scr = new Scanner(System.in);
    System.out.println("Enter the first String");
    String s1 = scr.nextLine();
    System.out.println("Enter the second String");
    String s2 = scr.nextLine();

    if (isAnagram(s1, s2)) {
        System.out.println(s1 + " and " + s2 + " are anagrams");
    } else {
        System.out.println(s1 + " and " + s2 + " are not anagrams");
    }
    scr.close();

}

}
`

[lalit-ky]

public class Anagrams {
    static boolean areAnagrams(String str1, String str2) {
        str1 = str1.toLowerCase().replace(" ", "");
        str2 = str2.toLowerCase().replace(" ", "");
        int[] arr = new int[26];
        for (int i = 0; i < str1.length(); i++) {
            int ch = str1.charAt(i);
            arr[ch - 97]++;
        }
        for (int i = 0; i < str2.length(); i++) {
            int ch = str2.charAt(i);
            arr[ch - 97]--;
        }
        int i;
        for (i = 0; i < 26; i++) {
            if (arr[i] != 0) {
                return false;
            }
        }
        return true;
    }

    public static void main(String[] args) {
        String str1 = "Tom Marvolo Riddle";
        String str2 = "I am Lord Voldemort";
        System.out.println(areAnagrams(str1, str2) ? "Anograms" : "Not Anograms");
    }
}

[sruthi-15-sketch]

import java.util.*;
public class Main
{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
String a=sc.nextLine();
String b=sc.nextLine();
a=a.replace(" ","").toLowerCase();
b=b.replace(" ","").toLowerCase();
if (a.length()!=b.length()){
System.out.println("They cannot be Anagrams!! They are not of same length");
}
else{
HashMap<Character,Integer> h1=new HashMap<>();
HashMap<Character,Integer> h2=new HashMap<>();
for(int i=0;i<a.length();i++){
if (!h1.containsKey(a.charAt(i))){
h1.put(a.charAt(i),1);
}
else{
h1.put(a.charAt(i),h1.get(a.charAt(i)));
}
if (!h2.containsKey(b.charAt(i))){
h2.put(b.charAt(i),1);
}
else{
h2.put(b.charAt(i),h2.get(b.charAt(i)));
}
}
if (h1.equals(h2)){
System.out.println("They are Anagrams!!");
System.out.println("Unique elements are "+h1.size());}
else
System.out.println("They are not Anagrams!!");
}
}
}

[Amrit-Raj22]

package week3d4;

import java.util.*;

public class AnagramString {
    static int checkAnagram(String str1, String str2) {
        
        int count = 0;
        char arr1[] = (str1.replaceAll(" ", "")).toLowerCase().toCharArray();
        char arr2[] = (str2.replaceAll(" ", "")).toLowerCase().toCharArray();

        Arrays.sort(arr1);
        Arrays.sort(arr2);
        System.out.println(arr1);
        System.out.println(arr2);

        for (int i = 0; i < arr1.length; i++) {
            count++;
            if (arr1[i] != arr2[i]) {
                System.out.println("not anagram !!");
                return 0;
            }
        }

        System.out.println("anagram !!" + count);
        return 0;
    }

    public static void main(String[] args) {
        // Scanner scanner = new Scanner(System.in);
        // String str1 = scanner.nextLine();
        // String str2 = scanner.nextLine();
        String str1 = "Tom Marvolo Riddle";
        String str2 = "I am Lord Voldemort";
        checkAnagram(str1, str2);

    }

}

[aish955]

`import java.util.Arrays;

public class Anagram {
public static void main(String[] args) {
String str1 = "Tom Marvolo Riddle";
String str2 = "I am Lord Voldemort";

    str1 = str1.toLowerCase();
    str2 = str2.toLowerCase();
    str1 = str1.replace(" ", "");
    str2 = str2.replace(" ", "");

    if (str1.length() == str2.length()) {
        char[] arr1 = str1.toCharArray();
        char[] arr2 = str2.toCharArray();

        Arrays.sort(arr1);
        Arrays.sort(arr2);

        boolean res = Arrays.equals(arr1, arr2);

        if (res) {
            System.out.println("anagram");
        } else {
            System.out.println("not anagram");
        }
    } else {
        System.out.println("not anagram");
    }
}

}`

[GonaBhavya]

import java.util.Arrays;
import java.util.Scanner;
public class Main
{
public static void main(String[] args) {
Scanner s= new Scanner(System.in);
String s1=s.next();
String s2=s.next();
s1=s1.toLowerCase();
s2=s2.toLowerCase();
if(s1.length()==s2.length()){
char[] a1=s1.toCharArray();
char[] a2=s2.toCharArray();
Arrays.sort(a1);
Arrays.sort(a2);
boolean result=Arrays.equals(a1,a2);

	if(result){
	    String temp="";
	    for(int i=0;i<s1.length();i++){
	        if(temp.indexOf(s1.charAt(i))==-1){
	            temp=temp+s1.charAt(i);
	        }
	    }
	    System.out.println(temp.length());
	}
    }
}

}

[SaichaitanyareddyG]

He Who Must Not Be Named

`import java.util.Arrays;
import java.util.Scanner;

class Main {
public static void main(String[] args) {

Scanner input = new Scanner(System.in);

System.out.print("Enter first String: ");
String str1 = input.nextLine();
System.out.print("Enter second String: ");
String str2 = input.nextLine();

if(str1.length() == str2.length()) {

  char[] charArray1 = str1.toCharArray();
  char[] charArray2 = str2.toCharArray();

  Arrays.sort(charArray1);
  Arrays.sort(charArray2);

 
  boolean result = Arrays.equals(charArray1, charArray2);

  if(result) {
    System.out.println(str1 + " and " + str2 + " are anagram.");
      for (int i = 0; i < str1.length(); i++)
{
    int flag = 0;
    for (int j = 0; j < str1.length(); j++)
    {
        if (str1.charAt(i) == str1.charAt(j) && i != j)
        {
            flag = 1;
            break;
        }
    }
    if (flag == 0)
        System.out.print(str1.charAt(i)+" ");
}
  }
  else {
    System.out.println(str1 + " and " + str2 + " are not anagram.");
  }
}
else {
  System.out.println(str1 + " and " + str2 + " are not anagram.");
}

}
}`

[Ashwesh09]

package week4;

import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;

public class AnagramStrings {
    public static void main(String[] args) {
        String str1 = "Tom Marvolo Riddle";
        String str2 = "I am Lord Voldemort";
        str1 = str1.replaceAll("\\s", "");
        str2 = str2.replaceAll("\\s", "");
        int count = 0;
        for (char c : str1.toCharArray()) {
            if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'))
                count++;
        }
        for (char c : str2.toCharArray()) {
            if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'))
                count--;
        }
        if(count == 0)  {
            System.out.println("they are anagrams.");
            Set<Character> s= new HashSet<>();
            for (char c : (str1 + str2).toCharArray()) {
                if (!((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z') || (c >= '0' && c <= '9')))
                    s.add(c);
            }
            System.out.println("Unique characters are : " + s.size() + " They are:"+s);
        }
        else    
            System.out.println("they are not anagrams.");
    }
}

[shreiyarandive]

package Week4;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public class Anagram {

    public static boolean isAnagram(String str1, String str2) {
        if (str1.length() == str2.length()) {

            List<Character> li1 = new ArrayList<Character>();
            List<Character> li2 = new ArrayList<Character>();

            for (int i = 0; i < str1.length(); i++) {
                li1.add(str1.charAt(i));
            }

            for (int i = 0; i < str2.length(); i++) {
                li2.add(str1.charAt(i));
            }

            Collections.sort(li1);
            Collections.sort(li2);

            return li1.equals(li2);
        }
        return false;
    }

    public static void main(String[] args) {

        String str1 = "Tom Marvolo Riddle";
        String str2 = "I am Lord Voldemort";

        str1 = str1.toLowerCase().replace(" ", "");
        str2 = str2.toLowerCase().replace(" ", "");

        if (isAnagram(str1, str2)) {
            System.out.println(str1 + " and " + str2 + " are Anagrams");
        } else {
            System.out.println(str1 + " and " + str2 + " are not Anagrams");
        }

    }
}

[SrideviYamala]

import java.util.Arrays;

public class AnagramTask {
    public static void main(String[] args) {
        String str1 = "Tom Marvolo Riddle".replaceAll(" ","").toLowerCase();
        String str2 = "I am Lord Voldemort".replaceAll(" ","").toLowerCase();
        char[] a1 = str1.toCharArray();
        char[] a2 = str2.toCharArray();
        int n1 = str1.length();
        int n2 = str2.length();
        if (n1 == n2)
        {
            Arrays.sort(a1);
            Arrays.sort(a2);
            if(Arrays.equals(a1,a2)))
            {
                System.out.println("Anagrams");
            }
            else
            {
                System.out.println("Not Anagrams");
            }    
        }
        else if(n1!=n2)
        {
           System.out.println("Not Anagrams"); 
        }            
    }
}

[vysh675]

import java.io.;
import java.util.;

class anagram {

static int NO_OF_CHARS = 256;

static boolean areAnagram(char str1[], char str2[]) {

    int count1[] = new int[NO_OF_CHARS];
    Arrays.fill(count1, 0);
    int count2[] = new int[NO_OF_CHARS];
    Arrays.fill(count2, 0);
    int i;

    for (i = 0; i < str1.length && i < str2.length; i++) {
        count1[str1[i]]++;
        count2[str2[i]]++;
    }

    if (str1.length != str2.length)
        return false;

    for (i = 0; i < NO_OF_CHARS; i++)
        if (count1[i] != count2[i])
            return false;

    return true;
}

public static void main(String args[]) {
    String str1 = "Tom Marvolo Riddle";
    String str2 = "I am Lord Voldemort";
    char arrstr1[] = str1.toCharArray();
    char arrstr2[] = str2.toCharArray();

    // Function call
    if (areAnagram(arrstr1, arrstr2))
        System.out.println("The two strings are"
                + "anagram of each other");
    else
        System.out.println("The two strings are not"
                + " anagram of each other");
}

}

[ratnadeepikavuddagiri]

`import java.util.*;
public class Anagrams {

public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    String str1,str2;
    str1 = scanner.nextLine();
    str2 = scanner.nextLine();
    if(str1.length() != str2.length()) 
        System.out.println("Not Anagrams.");

    else{
        if(checkAnagrams(sortString(str1).toLowerCase(),sortString(str2).toLowerCase()))
            System.out.println("Anagrams");
        else
        System.out.println("Not Anagrams.");
    }        
}

static String sortString(String str){
    str=str.replace(" ","");
    char ch[]=str.toCharArray();
    Arrays.sort(ch);
    return new String(ch);
}
static boolean checkAnagrams(String str1,String str2){
    int n = str1.length();
    for(int i=0;i<n;i++){
        if(str1.charAt(i) != str2.charAt(i))
            return false;
    }
    return true;
}

}
`

[Snehil6197]

public class MyClass {
static int check(int[] arr){
for(int i=0;i<arr.length;i++)
{
if(arr[i]!=0)
{
return -1;
}
}
return 1;
}
public static void main(String args[]) {
String str1 = "Tom Marvolo Riddle";
String str2 = "I am Lord Voldemort";
str1= str1.toLowerCase().replaceAll("\s", "");
str2= str2.toLowerCase().replaceAll("\s", "");
int[] arr=new int[26];
int count=0;

    for(int i=0;i<str1.length();i++)
    {
        arr[(int)str1.charAt(i)-'a']+=1;
    }
    for(int i=0;i<str2.length();i++)
    {
        arr[(int)str2.charAt(i)-'a']-=1;
    }
   
    int ans=check(arr);
    if(ans==1){
        System.out.println("anagram");
    }
    else{
        System.out.println("not anagram");
    }
}

}

[ShraddhaPenshanwar]

He Who Must Not Be Named

Two strings are called anagrams if they contain the same set of characters but in a different order. Example: keep, peek

Write a Java program to check whether two strings are anagram or not. The program takes the following two strings as inputs and finds out whether they are anagrams of each other.

String str1 = "Tom Marvolo Riddle"
String str2 = "I am Lord Voldemort"

If the strings are anagrams of each other, print the count of unique characters in either of them.

`package Strings;

import java.util.*;

public class Anagrams {
public static void main(String[] args) {
String str1 = "Tom Marvolo Riddle".toLowerCase();
String str2 = "I am Lord Voldemort".toLowerCase();
HashMap<Character, Integer> map = new HashMap<Character, Integer>();
boolean flag = true;

    if (str1.length() != str2.length()) {
        flag = false;
    } else {
        for (int i = 0; i < str1.length(); i++) {
            if (map.containsKey(str1.charAt(i))) {
                map.put(str1.charAt(i), map.get(str1.charAt(i)) + 1);
            } else {
                map.put(str1.charAt(i), 1);
            }
        }

        for (int i = 0; i < str2.length(); i++) {
            if (map.containsKey(str1.charAt(i))) {
                map.put(str1.charAt(i), map.get(str1.charAt(i)) - 1);
            } else {
                flag = false;
                break;
            }
        }
        for (Character ch : map.keySet()) {
            if (map.get(ch) != 0) {
                flag = false;
                break;
            }
        }
    }

    if (flag == false) {
        System.out.println("Stirngs are not an Anagrams");
    }else{
        System.out.println("Strings are Anagrams");
    }

}

}
`

[KaminiJha]

import java.util.Scanner;

public class Anagram {
    public static void main(String[] args) {
        String s1 = "I am Lord Voldemort";
        String s2 =  "Tom Marvolo Riddle";
        s1=s1.toLowerCase().replaceAll(" ", "");
        s2=s2.toLowerCase().replaceAll(" ", "");
        boolean areAnagram = checkAnagram(s1, s2);
        if (areAnagram == true) {
            int[] arr = uniqueCharacters(s1);
            int count = 0;
            for (int i = 0; i < 26; i++) {
                if (arr[i] > 0) {
                    count++;
                }
            }
            System.out.println("Count of unique charcters are " + count);
        } else {
            System.out.println("Not anagram");
        }

    }

    public static boolean checkAnagram(String s1, String s2) {
        int[] str1 = uniqueCharacters(s1);
        int[] str2 = uniqueCharacters(s2);
        for (int i = 0; i < 26; i++) {
            if (str1[i] != str2[i]) {
                return false;
            }
        }
        return true;
    }

    public static int[] uniqueCharacters(String s1) {
        int[] arr = new int[26];
        for (int i = 0; i < s1.length(); i++) {
            arr[s1.charAt(i) - 'a']++;
        }
        return arr;
    }

}

[KanimozhiThandapani]

package com.src;

import java.util.Arrays;  
public class StringAnagram {  
    public static void main (String [] args) {  
        String str1="Tom Marvolo Riddle";  
        String str2="I am Lord Voldemort";  
  
        //Converting both the string to lower case and removing the white spaces.  
        str1 = str1.toLowerCase().replaceAll("\\s", "");
        str2 = str2.toLowerCase().replaceAll("\\s", "");;  
        
        //Checking for the length of strings  
        if (str1.length() != str2.length()) {  
            System.out.println("Both the strings are not anagram");  
        }  
        else {  
            //Converting both the arrays to character array  
            char[] string1 = str1.toCharArray();  
            char[] string2 = str2.toCharArray();  
  
            //Sorting the arrays using in-built function sort ()  
            Arrays.sort(string1);  
            Arrays.sort(string2);  
  
            //Comparing both the arrays using in-built function equals ()  
            if(Arrays.equals(string1, string2) == true) {  
                System.out.println("Both the strings are anagram");  
            }  
            else {  
                System.out.println("Both the strings are not anagram");  
            }  
        }  
    }  
}   

[Trivikram-Sharma]

AnagramDemo.java

import java.util.Scanner;

public class AnagramDemo {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		String s1,s2;
		Scanner sc = new Scanner(System.in);
		System.out.println("Enter first String:");
		s1 = sc.nextLine();
		System.out.println("Enter second String:");
		s2 = sc.nextLine();
		
		s1 = s1.toLowerCase().replace(" ", "");
		s2 = s2.toLowerCase().replace(" ", "");
		
		char buff[] = s1.toCharArray();
		for(char ch: buff) {
			if(s2.contains(Character.toString(ch))) {
				s2 = s2.replaceFirst(Character.toString(ch), "");
			}
		}
		if(s2.isEmpty()) {
			System.out.println("The Strings are anagrams.");
		}
		else {
			System.out.println("The Strings are not anagrams.");
		}
		
	}

}

[SankalpHP]

package mypackage;


import java.util.Arrays;


public class Anagrams {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
       
		String s1 = "Race";
		String s2 = "Care";
		
		s1 = s1.toLowerCase();
		s2 = s2.toLowerCase();
		
		if(s1.length() == s2.length()) {
		char[] charArray1 = s1.toCharArray();
		char[] charArray2 = s2.toCharArray();
		
		Arrays.sort(charArray1);
		Arrays.sort(charArray2);
		
		boolean result = Arrays.equals(charArray1, charArray2);
		if(result) {
			System.out.println(s1 + " and " + s2 + " are anagram.");
			
		}else {
			System.out.println(s2 + " and " + s2 + " are not anagram.");
		}
		
		}else {
			System.out.println(s1 + " are not anagram.");
		}
		
	}

}
```java

[Manvendra1097-eng]

package com.spring.calculator;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Anagrams {

	public static void main(String[] args) {
		
		Scanner scan = new Scanner(System.in);
		
		System.out.println("Enter first String : ");
		String str1 = scan.nextLine();
		System.out.println("Enter Second String : ");
		String str2 = scan.nextLine();
		
		str1 = str1.replace(" ", "").toLowerCase();
		
		str2 = str2.replace(" ", "").toLowerCase();
		System.out.println(str2);
		
		if(str1.length()!=str2.length()) {
			System.out.println("Not an Anagram");
		}
		else {
			char[] char1 = str1.toCharArray();
			char[] char2 = str2.toCharArray();
			
			
			Arrays.sort(char1);
			Arrays.sort(char2);
			
			if(Arrays.equals(char1,char2)) {
			System.out.println("It's Anagram");
			HashMap<Character, Integer> map = new HashMap<Character, Integer>();
			 for (int i = 0; i < str1.length(); i++) {
				 map.put(char1[i], i);
			 }
			 System.out.println("unique character count  : "+map.size());
			}
			else 
				System.out.println("Not an Anagram");
		}
		
	}

}

[pendyalakamalkumar]

package com.anagram;

import java.util.Arrays;

public class AnagramString {
static void isAnagram(String str1, String str2) {
String s1 = str1.replaceAll("\s", "");
String s2 = str2.replaceAll("\s", "");
boolean status = true;
if (s1.length() != s2.length()) {
status = false;
} else {
char[] ArrayS1 = s1.toLowerCase().toCharArray();
char[] ArrayS2 = s2.toLowerCase().toCharArray();
Arrays.sort(ArrayS1);
Arrays.sort(ArrayS2);
status = Arrays.equals(ArrayS1, ArrayS2);
}
if (status) {
System.out.println(s1 + " and " + s2 + " are anagrams");
} else {
System.out.println(s1 + " and " + s2 + " are not anagrams");
}
}

public static void main(String[] args) {
	// TODO Auto-generated method stub
	  isAnagram("Keep", "Peek");  
        isAnagram("Mother In Law", "Hitler Woman");  
    }  

}

[Ishwar4342]

package com.example.anagrams;

import java.util.Arrays;

class Anagram {

public static void main(String[] args) {
	String s1= "Tom Marvolo Riddle";
	String s2= "I am Lord Voldemort";
	boolean status=true;
	if(s1.length()!=s2.length()){
		status =false;
	} else {
		char[] ArrayS1=s1.toLowerCase().toCharArray();
		char[] ArrayS2=s2.toLowerCase().toCharArray();
		Arrays.sort(ArrayS1);
		Arrays.sort(ArrayS2);
		status=Arrays.equals(ArrayS1,ArrayS2);
		
	}
	if(status) {
		System.out.println(s1 + "and" +s2+"are anagram");
	}else {
		
		System.out.println(s1 + "and" +s2+"are not  anagram");
	}
	
}

}

[synghs67]

package com.breakingcode;

import java.util.Arrays;

public class Anagrams {
	public static void isAnagrams (String str1, String str2) {
		String str1 = str1.replaceAll("\s", "");
		String str2 = str2.replaceAll("\s", "");
		boolean check = true;
		if (str1.length() != str2.length()) {
		check = false;
		} else {
		char[] ArrayS1 = str1.toLowerCase().toCharArray();
		char[] ArrayS2 = str2.toLowerCase().toCharArray();
		Arrays.sort(ArrayS1);
		Arrays.sort(ArrayS2);
		check = Arrays.equals(ArrayS1, ArrayS2);
		}
		if (check) {
		System.out.println(str1 + " is " + str2 + " Anagrams");
		} else {
		System.out.println(str1 + " is " + str2 + "  not Anagrams");
		} 
            
  

		
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		isAnagrams ("Tom Marvolo Riddle", "I am Lord Voldemort");
		isAnagrams("Keep" , "Peek" );
		isAnagrams ("Break", "Broke" );
		
		
	}

}

[harsha916]

https://github.com/harsha916/Anagram
PFA URL for Anagram Program

[Jits1995]

package com.string.excercise;

import java.util.Scanner;

public class MainAppAnagram {
	
	public static void main(String[] args){
		
		Scanner sc = new Scanner(System.in);
		String str1 = "";
		String str2 = "";
		boolean anagram = true;
		
		System.out.print("Enter String 1 = ");
		str1 = sc.nextLine();
		System.out.print("Enter String 2 = ");
		str2 = sc.nextLine();
		
		str1 = str1.toLowerCase().replaceAll(" ", "");
		str2 = str2.toLowerCase().replaceAll(" ", "");
		
		for(int i=0; i<str1.length(); i++){
			String temp = str1.charAt(i) + "";
			if(!str2.contains(temp)){
				anagram = false;
			}
		}
		
		for(int i=0; i<str2.length(); i++){
			String temp = str2.charAt(i) + "";
			if(!str1.contains(temp)){
				anagram = false;
			}
		}
		
		if(anagram){
			System.out.println("Both the string are anagram of each other");
		}else{
			System.out.println("Both the string are not anagram of each other");
		}
		
		sc.close();
	}

}

[akshaychromule61]

package src.string.anagram.program;

import java.util.Arrays;

public class StringAnagrm {
	public static boolean isAnagram(String str1, String str2) {
        str1=str1.replaceAll("\\s", "");
        str2=str2.replaceAll(" ", "");
        if(str1.length()!=str2.length()) {
        	return false;
        }else {
        	char[] c1 = str1.toLowerCase().toCharArray();
        	char[] c2=  str2.toLowerCase().toCharArray();
        	Arrays.sort(c1);
        	Arrays.sort(c2);
        	return Arrays.equals(c1, c2);
        }
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		//using uquals and sort method
		//using builder and hashpam
		String str1="Tom Marvolo Riddle";  
        String str2="I am Lord Voldemort"; 
        System.out.println(isAnagram("keep","peeks"));
	}

}