Word Break

Problem

Determine whether a string can be segmented into words from a given dictionary.

Examples

Example 1

Input: {"s":"leetcode","words":["leet","code"]}

Output: true

Example 2

Input: {"s":"catsandog","words":["cats","dog","sand","and","cat"]}

Output: false

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Word Break

Determine whether a string can be segmented into words from a given dictionary. Store whether each prefix of the input string can be segmented. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n³) worst-case with substring copies; O(n) DP storage.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.