Code Room
CodingHard
Question
Given a string s and a dictionary of words, return all sentences (space-joined) where s can be segmented into a sequence of dictionary words. Words may be reused. Return the sentences sorted lexicographically. The length of s is at most 20 and the dictionary has at most 1000 words.
Implement
word_break_all(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.