Word break problem | Simplified solution | Dynamic programming with strings | Love Babbar DSA sheet

A great E-book on Data structures and algorithms written by a software engineer who has himself worked in MNC's. Its available for a very affordable price.
Do check it out by clicking on the link below and boost your preparation.

________________________________________________________________________
Problem link:

Solution:

________________________________________________________________________
All my playlists:
DSA sheet:

Interview experiences:

Leetcode problems:

projects for resume:
___________________________________________________________________________
Connect with me on LinkedIn:

Connect with me on Instagram:

#dsa #dynamicprogramming #strings #gfg #coding #softwareengineer #SDE #Placement #competitiveprogramming #faang #leetcode

[tarungour]

Helpful video I was preparing for dp!! Well explained bhi..

[sanskritimaheshwari]

Very well explained! Please post the remaining videos of dp soon as well!!

[davendrabedwal]

Bro can u tell me whats the problem in this approach
bool wordBreak(string s, vector<string>& wordDict) {
int n=s.length();
vector<bool>exist(n+1, false);
string temp;
for(int i=1;i<=n;i++)
{
if(exist[i-1]==true)
{
temp.clear();
}
temp+=s[i];
if(find(wordDict.begin(), wordDict.end(), temp)!=wordDict.end())
{
exist[i]=true;
}
}
return exist.back();
}

[earningonlinevip]

bahut ganda explanation iss badiya striver ke aur log ke video h