Spell word with magnets
A box of fridge-magnet letters is given as the string tiles, one character per magnet. Return True if you can spell word using those magnets, consuming each magnet at most once. Matching is case-sensitive. Example: word 'moon' with tiles 'nofmoto' is True — the box holds an m, two o's, and an n.
Implement
can_build_word(word: str, tiles: str) → boolExamples
in
["moon","nofmoto"]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 10 min
solution.py
InputExpectedGot
["moon","nofmoto"]truenot run yetsample