Valid Anagram

Problem

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

An Anagram is a word formed by rearranging the letters of another, using all the original letters exactly once.

Input: Strings s and t. Output: Boolean.

Input: s = "anagram", t = "nagaram" → Output: true

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

Frequency Count — Build char count map for s, decrement for t. If any non-zero, false. Time: O(n), Space: O(1) (26 letters).
Sort and Compare — sorted(s) == sorted(t). Time: O(n log n).
Always first check len(s) == len(t); if not, immediately return false.
Follow-up: for Unicode, use a generic hash map.

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

An Anagram is a word formed by rearranging the letters of another, using all the original letters exactly once.

Input: Strings s and t. Output: Boolean.

Input: s = "anagram", t = "nagaram" → Output: true

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

Frequency Count — Build char count map for s, decrement for t. If any non-zero, false. Time: O(n), Space: O(1) (26 letters).
Sort and Compare — sorted(s) == sorted(t). Time: O(n log n).
Always first check len(s) == len(t); if not, immediately return false.
Follow-up: for Unicode, use a generic hash map.