[leetcode] 242. Valid Anagram _ Algorithm Problem Solve for python

1. Problem

242. 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


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

2. Solution

I solved this problem like this. If we use python Counter, we can easily solve this problem.

  • Complexity
    • Time complexity : O(N)
    • Space complexity : O(N)
  • Step
    • Use Counter, you can easily solve this problem.
class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        return Counter(s) == Counter(t)