Solution: Word Break II
Explore how to apply dynamic programming to solve the Word Break II problem by breaking a string into all possible valid word sequences using a dictionary. Understand both naive and optimized solutions, learn to build a DP table for prefix analysis, and evaluate time and space complexity for an efficient recursive approach.
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...