Leetcode Problem 139. Word Break

139. Word Break

Leetcode Solutions

Convert wordDict into a set words for constant-time lookups.
Initialize a queue with the starting node 0 and a set seen to keep track of visited nodes.
While the queue is not empty:
- Dequeue the first element start.
- If start equals the length of s, return true.
- Iterate over the range from start + 1 to the length of s:
  - For each end, if it has not been visited and the substring s[start:end] is in words, enqueue end and mark it as seen.
If the queue is exhausted without reaching the end, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen