Solution: Word Break

Let's solve the Word Break problem using the Dynamic Programming pattern.

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:

  • 11 \leq s.Length 250\leq 250

  • 11 \leq wordDict.Length 1000\leq 1000

  • 1 ...

Access this course and 1400+ top-rated courses and projects.