Word Break
Decide whether a string can be split into a sequence of dictionary words.
Progress cannot be saved in this browser, so completed lessons will reset when you leave.
Lesson notes
Try it before you watch
Restate the problem in your own words, list the edge cases, and sketch a solution with its running time. Then play the video and compare.
Reveal the key idea
dp[i] is true when some earlier split point j has dp[j] true and s[j:i] is a dictionary word. Store the words in a set for fast lookups.
Pattern: Dynamic programming. Define a state, write the recurrence between states, and compute each state only once.
Complexity
| Measure | Bound |
|---|---|
| Time | O(n²) substring checks |
| Extra space | O(n) |
Walkthroughs often start from a simpler approach first; aim to reach these bounds. New to Big-O? Read understanding algorithmic complexity.