Backend Engineering
Senior
programming
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.
Input: s = 'leetcode', wordDict = ['leet', 'code']
Output: trueInput: s = 'applepenapple', wordDict = ['apple', 'pen']
Output: trueInput: s = 'catsandog', wordDict = ['cats', 'dog', 'sand', 'and', 'cat']
Output: false
Example:
Input: s = 'leetcode', wordDict = ['leet', 'code']
Output: trueInput: s = 'applepenapple', wordDict = ['apple', 'pen']
Output: trueInput: s = 'catsandog', wordDict = ['cats', 'dog', 'sand', 'and', 'cat']
Output: false
Constraints:
- 1 <= s.length <= 300
- 1 <= wordDict.length <= 1000
- 1 <= wordDict[i].length <= 20
- s and wordDict[i] consist of only lowercase English letters.
Suggested Answer