Problem
Ask
Submissions

Problem: Word Break II

Medium
30 min
Explore how to apply dynamic programming to break a string into all valid word combinations using a given dictionary. Understand constraints, reuse dictionary words, and implement solutions that generate every possible sentence. This lesson helps you develop skills to solve complex string segmentation problems relevant to coding interviews.

Statement

You are given a string, s, and an array of strings, word_dict, representing a dictionary. Your task is to add spaces to s to break it up into a sequence of valid words from word_dict. We are required to return an array of all possible sequences of words (sentences). The order in which the sentences are listed is not significant.

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

Constraints:

  • 11 \leq s.length 20\leq 20

  • 11 \leq word_dict.length 1000\leq 1000

  • 11 \leq word_dict[i].length 10\leq 10

  • s and word_dict[i] consist of only lowercase English letters.

  • All the strings of word_dict are unique.

Problem
Ask
Submissions

Problem: Word Break II

Medium
30 min
Explore how to apply dynamic programming to break a string into all valid word combinations using a given dictionary. Understand constraints, reuse dictionary words, and implement solutions that generate every possible sentence. This lesson helps you develop skills to solve complex string segmentation problems relevant to coding interviews.

Statement

You are given a string, s, and an array of strings, word_dict, representing a dictionary. Your task is to add spaces to s to break it up into a sequence of valid words from word_dict. We are required to return an array of all possible sequences of words (sentences). The order in which the sentences are listed is not significant.

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

Constraints:

  • 11 \leq s.length 20\leq 20

  • 11 \leq word_dict.length 1000\leq 1000

  • 11 \leq word_dict[i].length 10\leq 10

  • s and word_dict[i] consist of only lowercase English letters.

  • All the strings of word_dict are unique.