Grokking the Coding Interview: Patterns for Coding Questions

0% completed

​

Solution: Valid Anagram

Problem Statement

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, using all the original letters exactly once.

Example 1:

Input: s = "listen", t = "silent"
Output: true

Example 2:

Input: s = "rat", t = "car"
Output: false

Example 3:

Input: s = "hello", t = "world"
Output: false

Constraints:

  • 1 <= s.length, t.length <= 5 * 10<sup>5</sup>
  • s and t consist of lowercase English letters.

.....

.....

.....

Like the course? Get enrolled and start learning!
Văn Trần Phú Quí

Văn Trần Phú Quí

· 2 years ago

I found this solution is simpler than posted solution. Just 1 question, do we need to check if length of s and t is equal to other?

class Solution {
  isAnagram(s, t) {
    if(s.length !== t.length) return false;
    for(let i = 0; i < s.length; i++){
      if(!t.includes(s[i])){
        return false;
      }
    }
    return true;
  }
};
Show 3 replies