Word Break (LeetCode 139) | Full Solution using memoization and dynamic programming

preview_player
Показать описание


Chapters:
00:00 - Intro
00:39 - Problem Statement
03:58 - Brute Force Approach
06:42 - DP using memoization
14:02 - Dry-run of Code16:19 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
Рекомендации по теме
Комментарии
Автор

The only video in YouTube on this problem which exactly able to show how the Memorization works!!!

shubhrajitghosh
Автор

By far the beat explanation of this coding problem on YT

DanielVazquez
Автор

Thanks! I was a bit confused in memorization working. Got it now.

TurtleHermit
Автор

Your explanations are god level on youtube Nikhil. You explain even a tricky question in such a simpler manner. Kudos to your effort 👍

niteshsingh
Автор

Why does this guy have only 63k subscriber he deserves at lots😊

More than bhaiya and didi 😅

anovaclub
Автор

Sir your explanations are just awesome, never stop uploading dsa content❤❤

kraken
Автор

For the first time i ahve understood dp..thru this sum..thank u so much sir 😭keep posting

teeheeee
Автор

Wow superb explanation sir, Now i am getting idea about how to use dp in this particular type of questions.

OnlyUpscOrBpsc
Автор

s.substr(j, i-j) hoga, as because s.substr() slices the string from j th index and the length will be i-j
by the way, love your teaching skill, it's so much helpful, thanks❤❤

wasimakrammallick
Автор

amazing explanation bro!! you made it so easy to understand. Thanks a lot ♥♥

Brijeshkumar-nlyy
Автор

solution beats 95% on leetcode, nicee

yomamasofat
Автор

Liked and subscribed and shared accross freinds

Please do more videos
You have clarity in your explanation

Keep posting


Thanks sir

GurunathR-ow
Автор

Checking up the Max length is interesting

rodrickedwards
Автор

please add this to dynamic programming playlist; I couldn't find it there

alirezaaramoun
Автор

Brother....one urgent request.... please make a video on Tim Sort, Cycle sort, Comb sort and Pigeonhole sorting algorithm with their underlying logic, code and animation in Hindi or English .Please it is very very urgent. I would be forever obliged 🙏🇮🇳🌹❤️

Soulofindia
Автор

complexity is n^3
2 loops and substring is another n.

yashhiran
Автор

🟡Sir can you help me with Leetcode 658 🚀

amanarora.
visit shbcf.ru