Sign in
Skip to solution
easyDSA

How do you check if two strings are anagrams?

381 views
01

Understand the problem

Explain anagram check.

stringshashing
02

Attempt it yourself

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

Nudge consolestandby

Stuck? Beam a request up — the console returns a conceptual nudge that guides your logic without spoiling the implementation.

03

Study the solution

Compare character counts: build a frequency map (or 26-length array) for one string and decrement for the other — all zero means anagram. O(n). Sorting both and comparing also works in O(n log n).

Solution ready — 2 min read

Classified // press E to declassify

04

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
05

Join the discussion

Discussion (0)

Sign in to join the discussion.

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

Transmission complete // awaiting log

KEEP THE
STREAK ALIVE.

Dossier 19 of 127 decoded in the Data Structures & Algorithms track. One more won't hurt.

Back to track