Solution: Word Break
Understand how to apply dynamic programming to solve the word break problem by building a lookup table that stores whether prefixes of the string can be segmented into valid dictionary words. Learn to optimize recursive solutions and evaluate time and space complexities.
Statement
Given a string, s, and a dictionary of strings, wordDict, check if s can be segmented into a space-separated sequence of one or more dictionary words. If yes, return TRUE; else, return FALSE.
Note: The same word in the dictionary may be used multiple times.
Constraints:
-
s.length -
wordDict.length...