leetle

Daily challenge for 2025-11-04

308. 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.

Note that the same word in the dictionary may be reused multiple times in the segmentation.

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

Explanation: Return true because "leetcode" can be segmented as "leet code".

Run this challenge interactively in Python or JavaScript when the app loads.