Valid Anagram

easy

Check if two strings are anagrams using character frequency

Valid Anagram

Key Insight

Count character frequencies. Anagrams have identical frequency maps.

Step 1Count First String
Frequency map for "anagram"
Array
a
0
n
1
a
2
g
3
r
4
a
5
m
6
HashMap
a:3
n:1
g:1
r:1
m:1

Count frequencies in "anagram": a=3, n=1, g=1, r=1, m=1

1 / 4

Learn the Pattern

Hash MapUse a hash map for O(1) lookup to track seen elements, frequencies, or complement values during array traversal.
Practice the Code

Step-by-Step Walkthrough: Valid Anagram

Count character frequencies. Anagrams have identical frequency maps.

  1. Count First String

    Count frequencies in "anagram": a=3, n=1, g=1, r=1, m=1

  2. Count Second String

    Count frequencies in "nagaram": a=3, n=1, g=1, r=1, m=1

  3. Compare Maps

    Both maps are identical. Same characters, same counts.

  4. Result

    "anagram" and "nagaram" ARE anagrams!