Leetcode Problem 140. Word Break II

140. Word Break II

Leetcode Solutions

Define a helper function that takes the current index and a memoization hashmap.
If the current index is at the end of the string, return a list with an empty string.
If the current index is in the memo, return the memoized result.
Initialize an empty list to store sentences formed from the current index.
Iterate over the string starting from the current index.
For each index, check if the substring from the current index to the iterating index is in the word dictionary.
If it is, recursively call the helper function with the next index.
For each sentence returned from the recursive call, append the current word and add it to the sentences list.
Memoize the result for the current index.
Return the list of sentences.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen