Practice Word Break
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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. Note that the same word in the dictionary may be reused multiple times in the segmentation.
Source: Word Break on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
s = "leetcode", wordDict = ["leet","code"]
Output
true
# Example 2
Input
s = "applepenapple", wordDict = ["apple","pen"]
Output
true
# Example 3
Input
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.
All the strings of wordDict are unique.
Related LeetCode Problems
Practice more problems similar to Word Break.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.