← Notes / DSA Patterns

Pattern 1: 3. Valid Anagram – Strings

DSA Patterns

Description: Check if two strings are anagrams.

Java

public boolean isAnagram(String s, String t)
{ if (s.length() != t.length()) return
false; int[] count = new int[26];
for (char c : s.toCharArray()) count[c - 'a']++;
for (char c : t.toCharArray()) if (--count[c - 'a'] < 0) return false;
return true;

}

C++

bool isAnagram(string s, string t) {
if (s.size() != t.size()) return false;
vector<int> count(26, 0);
for (char c : s) count[c - 'a']++;
for (char c : t) if (--count[c - 'a'] < 0) return false;
return true;
}

Python

def isAnagram(s, t):
return sorted(s) == sorted(t)
Report an issue with this note