Valid Anagram Python Solution with Tests

Tested Python solution for LeetCode 242 with 18 pytest cases. Generate a practice environment with lcpy.

LeetCode 242, Easy. Topics: Hash Table, String, Sorting. View on LeetCode.

Generate this problem as a practice environment: tested reference solution, 18 parametrized pytest cases, and a playground notebook:

lcpy gen -n 242   # by problem number
lcpy gen -s valid_anagram   # by problem name

​

Problem

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

​

Examples

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

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

​

Constraints

• 1 <= s.length, t.length <= 5 * 10^4
• 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

Reference implementation from solution.py on GitHub, full suite in test_solution.py:

from collections import Counter


class Solution:
    # Time: O(n)
    # Space: O(1) - at most 26 unique characters
    def is_anagram(self, s: str, t: str) -> bool:
        return Counter(s) == Counter(t)

​

Complexity

Time	Space
O(n)	O(1) - at most 26 unique characters

​

Tags

Grind 75, Grind, Blind 75, NeetCode 150, NeetCode 250, NeetCode All.