This practice workspace is built for desktop. Open it on a larger screen to start solving.

Word Break

Dynamic Programming·Medium

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.

The same word in wordDict may be reused multiple times in the segmentation.

Standard DP: dp[i] is true iff s[0:i] can be segmented. dp[0] = true; for each i, dp[i] is true if there exists j < i with dp[j] true and s[j:i] in the dictionary.

Examples

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

Output: true

Input: s = "applepenapple", wordDict = ["apple","pen"]

Output: true

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.

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Dynamic Programming
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.