Search⌘ K
AI Features

DIY: Word Break II

Explore how to break down a string into all possible space-separated sequences using a given list of substrings. Learn to implement a function that returns every valid combination, reinforcing skills in dynamic programming and string manipulation.

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