easyDSA

How do you check if two strings are anagrams?

Q: How do you check if two strings are anagrams?

**Intuition.** Two strings are anagrams if they contain the **same characters with the same counts** — just rearranged. So compare their character frequencies. If every count matches (and lengths are equal), they're anagrams. "listen" vs "silent": same letter counts listen silent <rect x="170" y="68" width="40" height="24" rx="4" fill="#22c55e" fill-opacity="0.18" stroke="#22c55e"

381 views

Understand the problem

Explain anagram check.

stringshashing

Attempt it yourself

Sketch your approach before reading the solution — that's what interviews test.

Stuck? AI Nudge Available

Get a conceptual hint to guide your logic without spoiling the final implementation.

Study the solution

The solution is waiting

Give it an honest attempt first — then compare your thinking with the full walkthrough.

Read the code

Frequency-count check

Run Playground

from collections import Counter

def is_anagram(s, t):
    if len(s) != len(t):
        return False
    return Counter(s) == Counter(t)


# --- demo ---
print(is_anagram("listen", "silent"))   # True
print(is_anagram("rat", "car"))         # False

Join the discussion

Discussion (0)

No responses yet. Be the first to share what you think.

What is a stable sorting algorithm?

How do you check if a binary tree is symmetric?