DEV Community

Cover image for JavaScript LeetCode Valid Anagram
Diego (Relatable Code)
Diego (Relatable Code)

Posted on • Originally published at relatablecode.com on

JavaScript LeetCode Valid Anagram

Prompt

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.

Example 1:

Input: s = "anagram", t = "nagaram" 
Output: true
Enter fullscreen mode Exit fullscreen mode

Analyzing the problem

Let’s this of what the problem is asking. We have to know the contents of the strings we’re analyzing. We also have to make sure that we’re keeping track of the letters as they should be exactly the same to confirm that it is an anagram.

Following that train of thought, we can early return if there is ever a difference in the letters they contain. But what does it mean to have the same letters? Well, essentially it’s mapping out the frequency of each letter for the first word we iterate over. When we iterate over the second word we can double-check with what.

Checking back on the first example provided we can visualize this by counting each letter:

javascript leetcode

Looking at the counts we can use this to validate in place as we iterate over the second word. Let’s see how this would look:

javascript leetcode

So the first time we run into the n in the second iteration we subtract it from the count. Anytime we go below 0 then we know the words are not valid anagrams.

Cool 😎, let’s get to coding.

The solution

Similar to our last problem we can use a hash table.

var isAnagram = function(s, t) {
    if (s.length != t.length) return false;
    const hashTable = {};

    for(let i = 0; i < s.length; i++) {
        if (!hashTable[s[i]]) {
          hashTable[s[i]] = 0;
        }
        hashTable[s[i]]++;
    }

    for(let j = 0; j< t.length; j++) {
        if (!hashTable[t[j]]){
          return false;  
        } 
        hashTable[s[j]]--; 
    }

    return true;
};
Enter fullscreen mode Exit fullscreen mode

In the first iteration, we add the frequency of every letter. If it doesn’t exist we create a 0 value at that point.

if (!hashTable[s[i]]) {
    hashTable[s[i]] = 0;
}
hashTable[s[i]]++;
Enter fullscreen mode Exit fullscreen mode

On the second iteration, we subtract all values. If no letter ever exists then we’ll hit the number 0 which means we'll return a false.

if (!hashTable[t[j]]){
   return false;  
} 
hashTable[s[j]]--;
Enter fullscreen mode Exit fullscreen mode

Let’s connect

If you liked this feel free to connect with me on LinkedIn or Twitter

Check out my free developer roadmap and weekly tech industry news in my newsletter.

Discussion (2)

Collapse
jonrandy profile image
Jon Randy • Edited on
const isAnagram = (s,t)=>''+[...s].sort()==[...t].sort()
Enter fullscreen mode Exit fullscreen mode
Collapse
diballesteros profile image
Diego (Relatable Code) Author

Nice, I like the one liner!