Anagram check
Given two lowercase strings a and b, return True if they are anagrams of each other (same letters with the same multiplicities) and False otherwise. Solve it using character counts, not by sorting. Both strings contain only lowercase letters and may be empty.
Implement
are_anagrams(a: str, b: str) → boolExamples
in
["listen","silent"]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 12 min
solution.py
InputExpectedGot
["listen","silent"]truenot run yetsample