Solution: Word Break II
Let's solve the Word Break II problem using the Dynamic Programming pattern.
Statement
You are given a string, s
, and an array of strings, wordDict
, representing a dictionary. Your task is to add spaces to s
to break it up into a sequence of valid words from wordDict
. We are required to return an array of all possible sequences of words (sentences). The order in which the sentences are listed is not significant.
Note: The same dictionary word may be reused multiple times in the segmentation.
Constraints:
-
s.length
-
...
Access this course and 1400+ top-rated courses and projects.