Problem statement

This challenge is an extension of the previous challenge. Again, you will be given a non-empty string s and a list of strings called subs. The subs list contains a unique set of strings. This time, you have to find a list of all the strings that can be created by breaking down string s into space-separated sequences of one or more strings from the subs list. A ...

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