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

firstly remove all the whitespaces and replace all the letters of the strings with lowercase letters. Then check if the length of both the strings are equal if no then return False else return sorted(...read more

I mentioned the brute force order n factorial method and a slightly more optimised version using a hash table. I was also writing pseudo code on the whiteboard after explaining and thinking out aloud ...read more