Start with the idea
Begin with the concrete question: Return whether the text can be segmented into dictionary words. For the visible input text=leetcode dict=[leet,code], the stated result is true. Before reading code, name the smallest piece of information that must survive from one step to the next. A one-dimensional DP state summarizes a prefix or a single parameter. Define its meaning before writing a recurrence. That is the mental model for Word Break DP; it gives you a reason for each update instead of a line of code to memorise.
The core mechanism is this: Mark a prefix reachable when an earlier reachable prefix is followed by a dictionary word. Treat it as a claim to test after every operation. Write down the state before the first operation, update it once, and ask which part of the claim is still true. If an item is skipped, inserted, or removed, explain why that action cannot destroy an answer that should be retained. A useful trace has columns for the current input position, the state before the step, the action, and the state afterward. Use the visible sample until the expected result becomes inevitable rather than merely plausible.
Now inspect the Rust sketch, not just its final expression. The supplied Rust sketch is a starting point.
Keep learning, for free
The rest of this lesson is waiting for you.
Create a free account to read the complete explanation, see the infographic, explore the code, and try the exercises. All 742 lessons and algorithm steps are included.
No payment details. Your account opens the complete Academy.