Word Break

Try to solve the Word Break problem.


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.


  • 11 \leq s.length 250\leq 250

  • 11 \leq wordDict.length 1000\leq 1000

  • 11 \leq wordDict[i].length 20\leq 20

  • s and wordDict[i] consist of only lowercase English letters.

  • All the strings of wordDict are unique.


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy