EasyArrays & Hashing•Acceptance: 63.2%
Valid Anagram: Frequency Counter
Real-World Engineering Context
Employed in spell checkers, text comparison tools, and linguistic cryptanalysis engines.
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.
Sample Test Cases
Input: ["anagram","nagaram"]
Expected: true
Input: ["rat","car"]
Expected: false
Input: ["a","ab"]
Expected: false
Constraints
- 1 <= s.length, t.length <= 5 * 10^4
- s and t consist of lowercase English letters.
Language:
Loading Monaco Code Editor (VS Code Engine)...
Lazy loaded client-side bundleReady to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.