Valid Anagram - Leetcode 242 - Hashmaps & Sets (Python)

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@helloworldcsofficial]

Do you recommend using Counter in an actual interview?

[@CharlyBraga]

I think maybe not. Because the interviewer wants to see your ability to solve a problem step by step.

[@CoryTheSimmons]

return sorted(s) == sorted(t) 🗿

[@venzdrop]

The time complexity matters and this one is slow

[@hamzaunsal301]

Another Solution :
def isAnagram(self, s, t):
return sorted(s) == sorted(t)

[@CharlyBraga]

It works, but the time complexity is a little higher, O(nlogn)

[@MrIrishBoss]

I used a similar approach to what I did in Ransom Note.
for i in set(s):
if s.count(i) != t.count(i) or len(s) != len(t):
return False
return True

[@CharlyBraga]

Is the time complexity really O(n)? I ask it because the Counter need run through list to creat the dictionary and sort the last one.

[@jorgesanabria6484]

This is an awesome series keep it up 👍🏾

[@GregHogg]

Thank you! :)

[@Srisaiganeshkommineni]

please reply sir,iam learning python and using in cpp will it possible because iam afraid so many are desupproting me like python is too slow you may not work in icpc and in c++ has so many libaries to solve problems where not in python or not idont know? @@GregHogg

[@christianjt7018]

nice short solution, thanks for sharing

[@ashraf_isb]

thanks for sharing this

[@GregHogg]

Thank you :)

[@cmarquay]

Happy end of year

[@GregHogg]

You too Christian!

[@KasthuriarachichigePrasanna]

great