- Published on
Leetcode 242 - Valid Anagram (JavaScript)
In my previous blogpost I discussed how palindromes are a great way to dip one's toes into algorithms. But an even simpler start is to work with an anagram. An anagram is a word that is formed from another using the original letters exactly once. So how would we go about determining whether one word is an anagram of another? Let's talk through how to solve Leetcode problem 242 - Valid Anagram.