Anagram Program in Java | String Anagram Program in Java

 

What is Anagram Program in Java?

The two strings are called as Anagram of each other if they contain the same characters either arranged in sequence or not it is not necessary.

How to check two Strings are Anagram or not?

To check whether the given two strings are Anagram of each other or not the compiler will ask the user to enter the two strings to check. After the input given by the user, the program will start executing are check whether the strings are Anagram or not.

After executing the compiler will display the output. The two strings are Anagram if and only if characters in that strings are the same sequence is not mandatory.

For Example abcd and dcba, creative and reactive, course and source are Anagram of each other.

Anagram Algorithm:

1 Step: Declare two Strings.

2 Step: Find out the length of two Strings (Strings are not anagram if the length of strings is not the same).

3 Step: Even if the lengths are equal the two strings should be in lowercase because it makes easy to check.

4 Step: Now sort the characters in the strings.For, sorting convert the strings into a character array.

5 Step: After converting character array must be sorted.

6 Step: In the last step, the Anagram is checked.

There are different ways to check the Anagram program in Java we will see it one by one.

1. Anagram Program in Java Using Sorting

To check whether the strings are anagram of each other we have to use two java methods i.e sort( ) and equals( ).

First, we have to remove all the white spaces between the characters of the string. Then all the characters will be converted to the lower case so the case will be ignored while checking.

Now the strings are converted into a character array and then sorted using sort( ) method. After sorting we will compare both the strings using equals( ) method.

If it returns true then the two strings are an anagram of each other else not anagram of each other.

In this program, we have declared two strings abcd and cabd. Now, the program will check whether the two Strings are Anagram or not.

Java

1

//learnprogramo

2

import java.util.Arrays;

3

import java.util.Scanner;

4

public class learnprogramo

5

{

6

public static void main(String[] args)

7

{

8

Scanner scanner = new Scanner(System.in);

9

// Getting the input string from the user

10

System.out.print("Enter the First String : ");

11

String s1 = scanner.nextLine();

12

System.out.print("Enter the second String : ");

13

String s2 = scanner.nextLine();

14

if(checkAnagram(s1, s2))

15

System.out.println(s1+" and "+s2+" are Anagrams");

16

else

17

System.out.println(s1+" and "+s2+" are NOT Anagrams");

18

scanner.close();

19

}

20

public static boolean checkAnagram(String s1, String s2)

21

{

22

// Remove all the white space

23

s1 = s1.replaceAll("\\s", "");

24

s2 = s2.replaceAll("\\s", ""); 

25

// Check if both length matches

26

if(s1.length() != s2.length())

27

return false;

28

else

29

{

30

// Convert both Strings into lower case and into Character Array

31

char[] arr1 = s1.toLowerCase().toCharArray();

32

char[] arr2 = s2.toLowerCase().toCharArray();

33

// Sort both Character Array

34

Arrays.sort(arr1);

35

Arrays.sort(arr2);

36

// Check if both arrays are equal

37

return (Arrays.equals(arr1, arr2));

38

}

39

}

40

}

Output:

2. Using Iterative Method

In this method, we check whether each character of the first string is situated in the second string. If the character is found then we remove that character from the second string and proceed to the next character.

And if the character is not found in the second string then the for loop is terminated. Then, we consider the given two strings are not an anagram of each other.

Java

1

//Learnprogramo

2

import java.util.Arrays;

3

import java.util.Scanner;

4

public class learnprogramo

5

{

6

static void isAnagram(String s1, String s2)

7

    {

8

String copyOfs1 = s1.replaceAll("\\s", "").toLowerCase();

9

String copyOfs2 = s2.replaceAll("\\s", "").toLowerCase();

10

//Initially setting status as true

11

boolean status = true;

12

if(copyOfs1.length() != copyOfs2.length())

13

{

14

status = false;

15

}

16

else

17

{

18

//Converting copyOfs1 to char array

19

char[] s1ToArray = copyOfs1.toCharArray();

20

for (char c : s1ToArray)

21

{

22

int index = copyOfs2.indexOf(c);

23

if(index != -1)

24

{

25

copyOfs2 = copyOfs2.substring(0, index)+copyOfs2.substring(index+1, copyOfs2.length());

26

}

27

else

28

{

29

status = false;

30

break;

31

}

32

}

33

}

34

//Output

35

if(status)

36

{

37

System.out.println(s1+" and "+s2+" are anagrams");

38

}

39

else

40

{

41

System.out.println(s1+" and "+s2+" are not anagrams");

42

}

43

}

44

public static void main(String[] args)

45

{

46

isAnagram("Mother In Law", "Hitler Woman");

47

isAnagram("keEp", "peeK");

48

isAnagram("SiLeNt CAT", "LisTen AcT");

49

isAnagram("Toss", "Shot");

50

isAnagram("joy", "enjoy");

51

}

52

}

Output:

3. Anagram Program in Java Using StringBuilder

This method is as same as the above method but, only the difference is that we ave used the java inbuilt method deletecharAt( ).

deletecharAt( ) method deletes the character from the second string if that character is present in the second string.

Java

1

//Learnprogramo

2

import java.util.Arrays;

3

import java.util.Scanner;

4

public class learnprogramo

5

{

6

static void isAnagram(String s1, String s2)

7

{

8

String copyOfs1 = s1.replaceAll("\\s", "").toLowerCase();

9

String copyOfs2 = s2.replaceAll("\\s", "").toLowerCase();

10

//Initially setting status as true

11

boolean status = true;

12

if(copyOfs1.length() != copyOfs2.length())

13

{

14

status = false;

15

}

16

else

17

{

18

//Converting copyOfs1 to char array

19

char[] s1Array = copyOfs1.toCharArray();

20

//Constructing StringBuilder from copyOfs2

21

StringBuilder sb = new StringBuilder(copyOfs2);

22

//Checking whether each character of s1Array is present in sb

23

for (char c : s1Array)

24

{

25

int index = sb.indexOf(""+c);

26

if (index != -1)

27

{

28

//If present, removing that character from sb

29

sb = sb.deleteCharAt(index);

30

}

31

else

32

{

33

status = false;

34

break;

35

}

36

}

37

}

38

//Output

39

if(status)

40

{

41

System.out.println(s1+" and "+s2+" are anagrams");

42

}

43

else

44

{

45

System.out.println(s1+" and "+s2+" are not anagrams");

46

}

47

}

48

public static void main(String[] args)

49

{

50

isAnagram("Mother In Law", "Hitler Woman");

51

isAnagram("keEp", "peeK");

52

isAnagram("SiLeNt CAT", "LisTen AcT");

53

isAnagram("Toss", "Shot");

54

isAnagram("joy", "enjoy");

55

}

56

}

Output:

4. Using HashMap

To construct a HashMap we need Key and the Value. So, in this method, we will construct one object of HashMap where the character will be Key and the character occurrence as the value.

At first, we will increment the character count by 1. If the character is present in the first string and then decrement by 1 if that character is present in the second string.

In this way, we check the character count of the entire string. If any character count is not equal to zero, then both the string is not an anagram of each other.

Java

1

//Learnprogramo

2

import java.util.HashMap;

3

import java.util.Scanner;

4

public class learnprogramo

5

{

6

public static void main(String[] args)

7

{

8

Scanner scanner = new Scanner(System.in);

9

// Getting the input string from the user

10

System.out.print("Enter the First String : ");

11

String s1 = scanner.nextLine();

12

System.out.print("Enter the second String : ");

13

String s2 = scanner.nextLine();

14

if (checkAnagram(s1, s2))

15

System.out.println(s1 + " and " + s2 + " are Anagrams");

16

else

17

System.out.println(s1 + " and " + s2 + " are NOT Anagrams");

18

scanner.close();

19

}

20

public static boolean checkAnagram(String s1, String s2)

21

{

22

if (s1.length() != s2.length())

23

return false;

24

HashMap<Character, Integer> map = new HashMap<Character, Integer>();

25

for (int i = 0; i < s1.length(); i++)

26

{

27

char c = s1.charAt(i);

28

if (map.containsKey(c))

29

map.put(c, map.get(c) + 1);

30

else

31

map.put(c, 1);

32

}

33

for (int i = 0; i < s2.length(); i++)

34

{

35

char c = s2.charAt(i);

36

if (map.containsKey(c))

37

{

38

if (map.get(c) == 1)

39

map.remove(c);

40

else

41

map.put(c, map.get(c) - 1);

42

}

43

else

44

return false;

45

}

46

if (map.size() > 0)

47

return false;

48

return true;

49

}

50

}

Output:

5. Anagram Program in Java Using X-OR

In this program, we will use the logic of XOR. Here, XOR returns bit by bit digits of XOR.

If XOR returns 1 then the bits are different and if XOR returns 0 then the bits are same.

C

1

//Learnprogramo

2

import java.util.Scanner;

3

public class learnprogramo

4

{

5

public static void main(String[] args)

6

{

7

Scanner scanner = new Scanner(System.in);

8

// Getting the input string from the user

9

System.out.print("Enter the First String : ");

10

String s1 = scanner.nextLine();

11

System.out.print("Enter the second String : ");

12

String s2 = scanner.nextLine();

13

if (checkAnagram(s1, s2))

14

System.out.println(s1 + " and " + s2 + " are Anagrams");

15

else

16

System.out.println(s1 + " and " + s2 + " are NOT Anagrams");

17

scanner.close();

18

}

19

public static boolean checkAnagram(String s1, String s2)

20

{

21

// Remove all the white space, convert to lower case & character array

22

char[] arr1 = s1.replaceAll("\\s", "").toLowerCase().toCharArray();

23

char[] arr2 = s2.replaceAll("\\s", "").toLowerCase().toCharArray();

24

if (arr1.length != arr2.length)

25

return false;

26

int xor = 0;

27

for (int i = 0; i < arr1.length; i++)

28

{

29

xor ^= arr1[i] ^ arr2[i];

30

}

31

return xor == 0? true: false;

32

}

33

}

Output:

6. Using ArrayList

In this method, each character of the string is added to the list and then whether both the lists are equal are checked.

C

1

//Learnprogramo

2

import java.util.ArrayList;

3

import java.util.Collections;

4

import java.util.List;

5

import java.util.Scanner;

6

public class learnprogramo

7

{

8

public static void main(String[] args)

9

{

10

Scanner scanner = new Scanner(System.in);

11

// Getting the input string from the user

12

System.out.print("Enter the First String : ");

13

String s1 = scanner.nextLine();

14

System.out.print("Enter the second String : ");

15

String s2 = scanner.nextLine();

16

if (checkAnagram(s1, s2))

17

System.out.println(s1 + " and " + s2 + " are Anagrams");

18

else

19

System.out.println(s1 + " and " + s2 + " are NOT Anagrams");

20

scanner.close();

21

}

22

public static boolean checkAnagram(String s1, String s2)

23

{

24

s1 = s1.replaceAll("\\s", "").toLowerCase();

25

s2 = s2.replaceAll("\\s", "").toLowerCase();

26

if (s1.length() != s2.length())

27

return false;

28

List<Character> list1 = new ArrayList<Character>();

29

List<Character> list2 = new ArrayList<Character>();

30

for (int i = 0; i < s1.length(); i++)

31

{

32

list1.add(s1.charAt(i));

33

}

34

for (int i = 0; i < s2.length(); i++)

35

{

36

list2.add(s2.charAt(i));

37

}

38

Collections.sort(list1);

39

Collections.sort(list2);

40

if (list1.equals(list2))

41

return true;

42

else

43

return false;

44

}

45

}

Output:

Conclusion:

So in this lesson, we have learned about the anagram program in C. If you have any doubt then please feel free to share it in the comment box given below.