Loading…

Valid Anagram — Interactive Python Lesson | TraceCode

Arrays

Valid Anagram

Learn how to determine if two strings are anagrams using a hash map character frequency counter in O(n) time.

Interactive Python lesson with 66 traced steps across 3 test cases.

Python code

def is_anagram(s, t):
    if len(s) != len(t):
        return False
    count = {}
    for char in s:
        count[char] = count.get(char, 0) + 1
    for char in t:
        count[char] = count.get(char, 0) - 1
        if count[char] < 0:
            return False
    return True

Test cases

Test 1
```
s = "anagram"
t = "nagaram"
```
41 visible steps
Test 2
```
s = "rat"
t = "car"
```
14 visible steps
Test 3
```
s = "a"
t = "a"
```
11 visible steps

Loading the interactive TraceCode visualizer…