Valid Anagram — Easy Coding Interview Question

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.

Example

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

Output: true

Constraints

• 1 ≤ s.length, t.length ≤ 5 × 10⁴
• s and t consist of lowercase English letters

Topics & Companies

Topics: arrays, hash-map

Asked by: Amazon, Bloomberg, Microsoft, Google

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(1).

Practice more

• All DSA Problems
• DSA Patterns