Word Break
Try to solve the Word Break problem.
We'll cover the following
Statement
Given a string, s
, and a dictionary of strings, word_dict
, check if s
can be segmented into a space-separated sequence of one or more dictionary words. If yes, return TRUE; else, return FALSE.
Note: The same word in the dictionary may be used multiple times.
Constraints:
-
s.length
-
word_dict.length
-
word_dict[i].length
-
s
andword_dict[i]
consist of only lowercase English letters. -
All the strings of
word_dict
are unique.
Examples
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Educative's Terms of Service and Privacy Policy