We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 07331bd commit 53ab86aCopy full SHA for 53ab86a
valid-anagram/bskkimm.py
@@ -0,0 +1,6 @@
1
+from collections import Counter
2
+class Solution:
3
+ def isAnagram(self, s: str, t: str) -> bool:
4
+ # Anagram is a word formed by rearranging each letter of a word exactly once.
5
+ # s = "anagram", t = "nagaram"
6
+ return Counter(s) == Counter(t)
0 commit comments