Python solution beats 98.92%


  • 0
    Z

    def isAnagram(self, s, t):
    letters = "abcdefghijklmnopqrstuvwxyz"
    for ch in letters:
    if s.count(ch) != t.count(ch):
    return False
    return True


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.