Valid Anagram

4Easy

Valid Anagram

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

Example 1:

** Input: s = "anagram", t = "nagaram" Output: true

Example 2:

** Input: s = "rat", t = "car" Output: false

Constraints:

1 <= s.length, t.length <= 5 * 10^4
s and t consist of lowercase English letters.

Jnaneshwara Reddy Satti

Builder · ClearCode

Hi — I'm a 21yo CS grad from India. I built ClearCode while recovering from a surgery, because I genuinely believe DSA should be visual, free, and accessible to everyone. No VC funding. No team. Just me, my laptop, and a lot of chai. ☕

If ClearCode helped you understand even one concept — consider supporting it. Every rupee keeps the servers running and new videos coming.

Support via Razorpay

Found this helpful? Support ClearCode ☕ — keeps it free forever

Algorithm Visualizer

O(N)

Welcome

TEST CASE: []O(N)

clearcode.in

Execution Trace

1def is_anagram(s, t):

2 if len(s) != len(t):

3 return False

4 count = {}

5 for char in s:

6 count[char] = count.get(char, 0) + 1

7 for char in t:

8 count[char] = count.get(char, 0) - 1

9 for val in count.values():

10 if val != 0:

11 return False

12 return True

0:00 / 13:36