Java Program To Check Whether Two Strings Are Anagram
Last Updated :
27 Dec, 2023
Write a function to check whether two given strings are anagrams of each other or not. An anagram of a string is another string that contains the same characters, only the order of characters can be different.
For example, "abcd" and "dabc" are an anagram of each other.
Program to Check Two Strings Are Anagram Of Each Other in Java
Below is the Program to check if two strings are anagrams Java using Sorting:
Java
// Java program to check whether two strings
// are anagrams of each other
import java.io.*;
import java.util.Arrays;
import java.util.Collections;
class GFG {
// Function to check whether two strings
// are anagram of each other
static boolean areAnagram(char[] str1, char[] str2)
{
// Get lengths of both strings
int n1 = str1.length;
int n2 = str2.length;
// If length of both strings is not
// same, then they cannot be anagram
if (n1 != n2)
return false;
// Sort both strings
Arrays.sort(str1);
Arrays.sort(str2);
// Compare sorted strings
for (int i = 0; i < n1; i++)
if (str1[i] != str2[i])
return false;
return true;
}
// Driver Code
public static void main(String args[])
{
char str1[] = { 't', 'e', 's', 't' };
char str2[] = { 't', 't', 'e', 'w' };
// Function Call
if (areAnagram(str1, str2))
System.out.println("The two strings are"
+ " anagram of each other");
else
System.out.println("The two strings are not"
+ " anagram of each other");
}
}
OutputThe two strings are not anagram of each other
Explanation of the Program:
In this method, we first sort both strings and then compare both of them. If both string are equal that means both are Anagram else both strings are not Anagram.
The complexity of the above method
Time Complexity: O(NLogN)
Auxiliary space: O(1).Â
Other Methods to Write Anagram Program in Java
There are certain methods to write an anagram program in Java as mentioned below:
- Count Characters
- Count Characters using one array
- Using HashMap()
1. Count characters for Checking Anagram
This method assumes that the set of possible characters in both strings is small. In the following implementation, it is assumed that the characters are stored using 8 bits and there can be 256 possible characters.Â
- Create count arrays of size 256 for both strings. Initialize all values in count arrays as 0.
- Iterate through every character of both strings and increment the count of characters in the corresponding count arrays.
- Compare count arrays. If both count arrays are the same, then return true.
Below is the implementation of the above idea:
Java
// Java program to check if two strings
// are anagrams of each other
import java.io.*;
import java.util.*;
// Driver Class
class GFG {
static int NO_OF_CHARS = 256;
// Function to check whether two strings
// are anagram of each other
static boolean areAnagram(char str1[], char str2[])
{
// Create 2 count arrays and initialize
// all values as 0
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 each character in input strings,
// increment count in the corresponding
// count array
for (i = 0; i < str1.length && i < str2.length;
i++) {
count1[str1[i]]++;
count2[str2[i]]++;
}
// If both strings are of different length.
// Removing this condition will make the
// program fail for strings like "aaca"
// and "aca"
if (str1.length != str2.length)
return false;
// Compare count arrays
for (i = 0; i < NO_OF_CHARS; i++)
if (count1[i] != count2[i])
return false;
return true;
}
// Driver code
public static void main(String args[])
{
char str1[] = ("geeksforgeeks").toCharArray();
char str2[] = ("forgeeksgeeks").toCharArray();
// Function call
if (areAnagram(str1, str2))
System.out.println("The two strings are"
+ "anagram of each other");
else
System.out.println("The two strings are not"
+ " anagram of each other");
}
}
OutputThe two strings areanagram of each other
The complexity of the above method:
Time Complexity: O(n)
Auxiliary space: O(n)
2. Count Characters Using one Array
The above implementation can be further to use only one count array instead of two. We can increment the value in the count array for characters in str1 and decrement for characters in str2. Finally, if all count values are 0, then the two strings are anagrams of each other. Thanks to Ace for suggesting this optimization.Â
Below is the implementation of the above method:
Java
// Java program to check if two strings
// are anagrams of each other
// Driver Class
class GFG {
static int NO_OF_CHARS = 256;
// Function to check if two strings
// are anagrams of each other
static boolean areAnagram(char[] str1, char[] str2)
{
// Create a count array and initialize
// all values as 0
int[] count = new int[NO_OF_CHARS];
int i;
// For each character in input strings,
// increment count in the corresponding
// count array
for (i = 0; i < str1.length; i++) {
count[str1[i] - 'a']++;
count[str2[i] - 'a']--;
}
// If both strings are of different
// length. Removing this condition
// will make the program fail for
// strings like "aaca" and "aca"
if (str1.length != str2.length)
return false;
// See if there is any non-zero
// value in count array
for (i = 0; i < NO_OF_CHARS; i++)
if (count[i] != 0) {
return false;
}
return true;
}
// Driver code
public static void main(String[] args)
{
char str1[] = "geeksforgeeks".toCharArray();
char str2[] = "forgeeksgeeks".toCharArray();
// Function call
if (areAnagram(str1, str2))
System.out.print("The two strings are "
+ "anagram of each other");
else
System.out.print("The two strings are "
+ "not anagram of each other");
}
}
OutputThe two strings are anagram of each other
The complexity of the above method
Time Complexity: O(n)
Auxiliary space: O(n)
3. Using HashMap()
We can optimize the space complexity of the above method by using HashMap instead of initializing 256 characters array. So in this approach, we will first count the occurrences of each unique character with the help of HashMap for the first string. Then we will reduce the count of each character while we encounter them in the second string. Finally, if the count of each character in the hash map is 0 then it means both strings are anagrams else not.
Below is the code for the above approach:
Java
// Java program to check if two
// strings are anagrams of each other
import java.io.*;
import java.util.*;
// Driver Class
class GFG {
// main function
public static boolean areAnagram(String a, String b)
{
// Check if both string has same length or not
if (a.length() != b.length()) {
return false;
}
// Creating a HashMap containing Character as Key
// and Integer as Value. We will be storing
// character as Key and count of character as Value.
HashMap<Character, Integer> map = new HashMap<>();
// Loop over all character of first string and put
// in HashMap.
for (int i = 0; i < a.length(); i++) {
// Check if HashMap already contain the current
// character or not
if (map.containsKey(a.charAt(i))) {
// If contains then increase count by 1
map.put(a.charAt(i),
map.get(a.charAt(i)) + 1);
}
else {
// else put that character in map and set
// count to 1 as character is encountered
// first time
map.put(a.charAt(i), 1);
}
}
// Now loop over String b
for (int i = 0; i < b.length(); i++) {
// Check if HashMap already contain the current
// character or not
if (map.containsKey(b.charAt(i))) {
// If contains reduce count of that
// character by 1 to indicate that current
// character has been already counted as
// idea here is to check if in last count of
// all characters in last is zero which
// means all characters in String a are
// present in String b.
map.put(b.charAt(i),
map.get(b.charAt(i)) - 1);
}
}
// Extract all keys of HashMap/map
Set<Character> keys = map.keySet();
// Loop over all keys and check if all keys are 0
// as it means that all the characters are present
// in equal count in both strings.
for (Character key : keys) {
if (map.get(key) != 0) {
return false;
}
}
// Returning True as all keys are zero
return true;
}
public static void main(String[] args)
{
String str1 = "geeksforgeeks";
String str2 = "forgeeksgeeks";
// Function call
if (areAnagram(str1, str2))
System.out.print("The two strings are "
+ "anagram of each other");
else
System.out.print("The two strings are "
+ "not anagram of each other");
}
}
OutputThe two strings are anagram of each other
The complexity of the above method:
Time Complexity: O(n)
Auxiliary space: O(n) because using HashMap
Reference
Please refer complete article on Check whether two strings are anagram of each other for more details!
Similar Reads
Java Program to Check Whether a String is a Palindrome
A string in Java can be called a palindrome if we read it from forward or backward, it appears the same or in other words, we can say if we reverse a string and it is identical to the original string for example we have a string s = "jahaj " and when we reverse it s = "jahaj"(reversed) so they look
8 min read
Java Program to Check Strings Anagram Using HashMap
Java Program to check whether two given strings are anagrams of each other or not using HashMap. What is an Anagram?A string is an anagram of another string if it contains the same characters in the same or in different order. Example of Anagram in JavaInput: s1 = "abcd" s2 = "cadb"Output: Two Strin
3 min read
Java Program To Check If A String Is Substring Of Another
Write a java program for a given two strings s1 and s2, find if s1 is a substring of s2. If yes, return the index of the first occurrence, else return -1. Examples : Input: s1 = "for", s2 = "geeksforgeeks"Output: 5Explanation: String "for" is present as a substring of s2. Input: s1 = "practice", s2
3 min read
Java Program to Check Whether the Character is Vowel or Consonant
In this article, we are going to learn how to check whether a character is a vowel or a consonant. So, the task is, for any given character, we need to check if it is a vowel or a consonant. As we know, vowels are ‘a’, ‘e’, ‘i’, ‘o’, ‘u’ and all the other characters (i.e. ‘b’, ‘c’, ‘d’, ‘f’ …..) are
4 min read
Check if two strings are same ignoring their cases
Given two strings str1 and str2. The task is to check if the two given strings are the same if a case-insensitive comparison is followed, i.e., the cases of the strings are ignored in Java. Examples: Input: str1 = "Geeks", str2 = "geeks" Output: Same Input: str1 = "Geek", str2 = "geeksforgeeks" Outp
15+ min read
Java Program to check if strings are rotations of each other or not
Given a string s1 and a string s2, write a snippet to say whether s2 is a rotation of s1? (eg given s1 = ABCD and s2 = CDAB, return true, given s1 = ABCD, and s2 = ACBD , return false)Algorithm: areRotations(str1, str2) 1. Create a temp string and store concatenation of str1 to str1 in temp. temp =
2 min read
Java Program to Find the Occurrence of Words in a String using HashMap
HashMap<Key, Value> provides the basic implementation of the Map interface of Java and import java.util.HashMap package or its superclass. HashMap stores the data in (Key, Value) pairs, and accessed by an index of another type (e.g. an Integer). One object is used as a key to another object. I
3 min read
Java Program To Check If A Linked List Of Strings Forms A Palindrome
Given a linked list handling string data, check to see whether data is palindrome or not? Examples: Input: a -> bc -> d -> dcb -> a -> NULL Output: True String "abcddcba" is palindrome. Input: a -> bc -> d -> ba -> NULL Output: False String "abcdba" is not palindrome. Reco
2 min read
Java Program to Check if strings are rotations of each other or not | Set 2
Given two strings s1 and s2, check whether s2 is a rotation of s1. Examples: Input : ABACD, CDABA Output : True Input : GEEKS, EKSGE Output : True We have discussed an approach in earlier post which handles substring match as a pattern. In this post, we will be going to use KMP algorithm's lps (lon
2 min read
Java Program to Implement Wagner and Fisher Algorithm for Online String Matching
The Wagner-Fischer Algorithm is a dynamic programming algorithm that measures the Levenshtein distance or the edit distance between two strings of characters. Levenshtein Distance(LD) calculates how similar are the two strings. The distance is calculated by three parameters to transform the string1
3 min read