Busiest letter
A username analyzer reports each handle's 'busiest letter'. Given a handle containing at least one ASCII letter (plus possibly digits, underscores, or mixed case), return the letter that occurs most often, comparing case-insensitively and ignoring non-letters. Return it as a lowercase one-character string; break ties by choosing the alphabetically smallest letter. For example, 'Mississippi' returns 'i' (i and s both appear four times).
Implement
busiest_letter(handle: str) → strExamples
in
["Mississippi"]out"i"What 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 11 min
solution.py
InputExpectedGot
["Mississippi"]"i"not run yetsample