We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 5882bc8 commit 6e87cabCopy full SHA for 6e87cab
242-valid-anagram.py
@@ -17,16 +17,17 @@
17
Follow up:
18
What if the inputs contain unicode characters? How would you adapt your solution to such case?
19
"""
20
-import collections
21
-class Solution(object):
22
- def isAnagram(self, s, t):
+# Time Complexity - O(N)
+# Space Complexity - O(1) Because maximum size for letters dict is 26
+class Solution:
23
+ def isAnagram(self, s: str, t: str) -> bool:
24
if len(s) != len(t):
25
return False
- letters = collections.defaultdict(int)
26
+ letters = {}
27
for c in s:
- letters[c] += 1
28
+ letters[c] = letters.get(c,0) + 1
29
for c in t:
- if letters[c] <= 0:
30
+ if letters.get(c,0) <= 0:
31
32
letters[c] -= 1
33
return True
0 commit comments