Python Data Structures and Algorithms Tutorial

Valid Anagram LeetCode Solution

❮ Previous Next ❯

In this tutorial, we will solve the Valid Anagram problem from LeetCode.

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 * 104
s and t consist of lowercase English letters.

Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?

Solution:

class Solution(object):
    def isAnagram(self, s, t):
        """
        :type s: str
        :type t: str
        :rtype: bool
        """
        if len(s) != len(t):
            return False

        char_count = {}

        for char in s:
            if char in char_count:
                char_count[char] += 1
            else:
                char_count[char] = 1

        for char in t:
            if char in char_count:
                char_count[char] -= 1
                if char_count[char] == 0:
                    del char_count[char]
            else:
                return False

        return len(char_count) == 0

❮ Previous Next ❯

Python Data Structures and Algorithms Tutorial

Python Data Structures and Algorithms Tutorial

Introduction to Data Structures and Algorithms

Python Lists

Popular LeetCode List Questions

Python Dictionaries

Popular LeetCode Dictionary Questions

Linear Data Structure

Non Linear Data Structure

Valid Anagram LeetCode Solution

Constraints:

Important Links