CodingEasycod-g1443

Subject GreedyLevel Entry–Mid~10 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → bool

Examples

in["moon","nofmoto"]outtrue

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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.