➜ ~

Playing Hacks and Stuffs!

---

Project maintained by h4ckyou Hosted on GitHub Pages — Theme by mattgraham

Valid Anagram

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.

They are various ways we can solve this and one way is this:

• Get the occurrence of each character in both string and store in a hash table
• For each key and value pair in htS, I’ll check if htT[s] != value if it isn’t then I return False
• I’ll also check if each key of htT is among htS if it isn’t then I return False
• And the last check is if the length of both string are not the same then I return False

Here’s the solve script: link

Another way to easily solve this is to first sort both strings then check if they are the same or not

Since for it to be anagram each they basically need to be the same after arranging the letters if scattered

Here’s the script:

class Solution:
    def isAnagram(self, s: str, t: str) -> bool:
        if sorted(s) != sorted(t):
            return False
        
        return True