← Back to Arrays & Strings

Valid Anagram

Easy

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.

Examples

Input: s = "anagram", t = "nagaram"

Output: true

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

Output: false

Constraints

  • Time complexity matters. Can you solve it in O(n) time?
  • Consider edge cases such as empty inputs or extreme values.
  • Optimize your solution for readability and maintainability.
// Write your solution here
function solution() {
// Your code here
}

Tips

  • • Consider using a hash map for efficient lookups
  • • Think about the time vs. space tradeoffs
  • • Can you solve it in a single pass?