Code Room
CodingHard
Question
Given a string s (length 1..20) and a dictionary word_dict of distinct words, add spaces to s to construct every sentence in which each segmented word is a dictionary word. The same dictionary word may be reused. Return all such sentences (words joined by single spaces) sorted ascending, or an empty list if no segmentation exists.
Implement
word_break(s: str, word_dict: list[str]) → list[str]Examples
in
["catsanddog",["cat","cats","and","sand","dog"]]out["cat sand dog","cats and dog"]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.