Check whether two strings are anagrams
Given exactly two ASCII strings, return whether their case-sensitive character frequencies match. Inputs are valid JSON and must not be modified unless the algorithm uses a local copy. This exercise probes typed data modeling, boundary handling, and algorithm selection.
Input
One JSON value: string[]. See the sample for its exact shape.
Output
One compact JSON value of type boolean. Strings include JSON quotes; arrays preserve the specified order.
Constraints
Array/string lengths are 0 to 10000 unless stated otherwise. Numbers are integers in [-1000000,1000000]; all computed results fit the safe integer range.
Example
Input
["listen","silent"]
Output
true
Example 2 input
["a b","ab "]
Output
true
Checks a boundary or contrasting case beyond the public examples.
Public test cases (2)
Input
["listen","silent"]
Expected output
true
Input
["rat","car"]
Expected output
false
Hints (2)
- Start with the required output order and the empty-input behavior.
- Count the first string and consume counts with the second
Target complexity: time O(n) · space O(n)