Skip to content

Practice Word Break II

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Problem Statement

Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences in any order. Note that the same word in the dictionary may be reused multiple times in the segmentation.

Source: Word Break II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "catsanddog", wordDict = ["cat","cats","and","sand","dog"]
Output
["cats and dog","cat sand dog"]

# Example 2

Input
s = "pineapplepenapple", wordDict = ["apple","pen","applepen","pine","pineapple"]
Output
["pine apple pen apple","pineapple pen apple","pine applepen apple"]

# Example 3

Input
s = "catsandog", wordDict = ["cats","dog","sand","and","cat"]
Output
[]

Constraints

1 <= s.length <= 20
1 <= wordDict.length <= 1000
1 <= wordDict[i].length <= 10
s and wordDict[i] consist of only lowercase English letters.
All the strings of wordDict are unique.
Input is generated in a way that the length of the answer doesn't exceed 10^5.

Related LeetCode Problems

Practice more problems similar to Word Break II.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.