Скачать или смотреть Word Break II | Day 30 | DP Memoization [ July LeetCoding Challenge ] [ Leetcode

The day 30 problem in July Leetcoding Challenge. ( Word Break II ).
Dynamic Programming Solution with Memoization.

Check out our other popular playlists:
✅✅✅[ Cracking the Coding Interview - Unique String ] :    • Cracking the Coding Interview - Unique String  
✅✅✅[ June Leetcoding Challenges ] :    • June LeetCoding Challenge 2020  
✅✅✅[ May Leetcoding challenges ]:    • May LeetCoding Challenge 2020  

Problem Link: https://leetcode.com/problems/word-br...
Problem statement:
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.

Note:
The same word in the dictionary may be reused multiple times in the segmentation.
You may assume the dictionary does not contain duplicate words.
Example 1:

Input:
s = "catsanddog"
wordDict = ["cat", "cats", "and", "sand", "dog"]
Output:
[
"cats and dog",
"cat sand dog"
]
Example 2:

Input:
s = "pineapplepenapple"
wordDict = ["apple", "pen", "applepen", "pine", "pineapple"]
Output:
[
"pine apple pen apple",
"pineapple pen apple",
"pine applepen apple"
]
Explanation: Note that you are allowed to reuse a dictionary word.
Example 3:

Input:
s = "catsandog"
wordDict = ["cats", "dog", "sand", "and", "cat"]
Output:
[]

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

Code Link: https://github.com/Algorithms-Made-Ea...

#coding #interview #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode