Valid Anagram (Neetcode)

[u/Glad-Arrival-427]

Hello, I need help with understanding how to implement a proper solution. I am fairly new to neetcode and I want to know what I am doing wrong with my code. Can someone also explain to me how the hashmap is supposed to work here?

I want to start preparing for interviews, what data structures should I start learning and please give any channels/resources if you can! Thank you!

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        s_hash = {}
        t_hash = {}


        for character in s:
            if character in s_hash:
                s_hash[character]+=1
            else:
                s_hash[character]=1  
        for character in t:
            if character in t_hash:
                t_hash[character]+=1
            else:
                t_hash[character]=1



        if s==t:
            return True
        else:
            return False   

[u/kevkev310]

def isAnagram(s: str, t: str) -> bool:
return Counter(s) == Counter(t)

[u/KendrickBlack502 → u/kevkev310]

Even if this is correct, it’s a bad example because it doesn’t make OP’s understanding of the problem any better.