Word Break

Medium

Topics
StringDynamic ProgrammingHash Table

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. A word may be reused.

Example 1

Input:  s = "leetcode", wordDict = ["leet","code"]
Output: true

Example 2

Input:  s = "catsandog", wordDict = ["cats","dog","sand","and","cat"]
Output: false

Constraints

  • 1 <= s.length <= 300
  • 1 <= wordDict.length <= 1000
  • All dictionary words are unique.
Run ⌘' · Submit ⌘⏎