Longest Common Substring PART 1 | Memoization | Java | Recursion, Dynamic Programming

preview_player
Показать описание
Longest Common Substring PART 1 | Top Down DP/Memoization | Java | Data Structures, Top Down Dynamic Programming - Software Engineering Interview/Placement/Leetcode Questions - MAANG/FAANG, Facebook, Google, Amazon, Microsoft, Netflix

WHAT IS COVERED IN THIS VIDEO:
1. Understand the problem
2. Thinking initial greedy approaches and why they don't work
3. Thinking simple recursion and why it doesn't work
4. Thinking through Include/Exclude Technique and deriving the recursive relation
5. Writing Recursive Relation into Algorithm
6. Identifying Base/Terminating conditions
7. Converting the Recursion algorithm into Top Down Dynamic Programming Algorithm - Dealing with Overlapping problems
8. Time and Space complexity analysis
9. Code walkthrough
10. Extension - What if we were asked to return the actual items picked and not just the maximum value - How to solve it

This problem is an example where direct recursion on the problem doesn't work. We have to solve a subproblem using Recursion and Dynamic Programming and then derive our final answer.

Playlists:-

If you feel that the content is useful, please SUBSCRIBE!
Рекомендации по теме
Комментарии
Автор

Perhaps the best explanation for the memoization approach available on youtube. Explained really well!

shikhar_
Автор

Really appreciate the in depth explanation and providing a beginner friendly intuition. Wish you the best brother!

ghhzhxbzhx
welcome to shbcf.ru