DIY: Word Break
We'll cover the following
Problem statement
You are given a non-empty string s
and a list of strings called subs
. The subs
list will contain a unique set of strings. Your job is to determine if s
can be broken down into a space-separated sequence of one or more strings from the subs
...
Create a free account to view this lesson.
Continue your learning journey with a 14-day free trial.
By signing up, you agree to Devpath's Terms of Service and Privacy Policy