LeetCode #139 - Word Break: Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. You may assume the dictionary does not contain duplicate words.

``` To solve the problem, we can use dynamic programming. We create a dp array where dp[i] will be true if s[0:i] can be segmented into dictionary words. We initialize dp[0] as true (an empty string can always be segmented). Then we iterate through each position in s and check if any previous segment s[j:i] exists in the wordDict. ```