All challenges
Algorithm challenge · DSA
Word Break
Difficulty
hard
Time
~35m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#dynamic-programming#strings
Mission file // read carefullyhard
Given a string s and a dictionary wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.
Example
s = "leetcode", wordDict = ["leet","code"] => true
Build with
wordBreak(s: string, wordDict: string[]) → boolPythonJavaScriptTypeScriptGoJavaC++Rust
4 tests · 1 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.