Longest Palindromic Substring | Recursion Memo | Bottom Up | DP On Strings | Leetcode 5

Channel:

codestorywithMIK

Subscribers:

92,300

Published on June 29, 2024 12:00:00 AM ● Video Link: https://www.youtube.com/watch?v=ij3X5SAhf_0

Duration: 47:31

4,173 views

151

iPad PDF NOTES - https://github.com/MAZHARMIK/Intervie...
Whatsapp Community Link : https://www.whatsapp.com/channel/0029...
This is the 24th Video of our Playlist "DP Concepts & Qns" by codestorywithMIK

This is the Sixth video of the "DP On Strings" series in this playlist.
In this video we will try to solve a good DP on strings problem : Longest Palindromic Substring | Recursion | Memo | Bottom Up | DP On Strings | Leetcode 5 | DP Concepts & Qns-24


I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.

Problem Name : Longest Palindromic Substring | Recursion | Memo | Bottom Up | DP On Strings | Leetcode 5 | DP Concepts & Qns-24 | codestorywithMIK
Company Tags : Amazon, Microsoft, Bloomberg, Uber
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Intervie...
Leetcode Link : https://leetcode.com/problems/longest...


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My Segment Tree Concepts Playlist :    • Segment Tree | Introduction | Basics ...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And...  
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Intervie...
Instagram :   / codestorywithmik  
Facebook :   / 100090524295846  
Twitter :   / cswithmik  
Subscribe to my channel :    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝


Approaches Summary :
Approach 1 - Recursion + Memoization
Memoization will help reduce time complexity for cases like - "aaaaaaaaa"
T.C : O(n^2) - Because the AMortized Time Complexity of solve() will become 1 due to memoization.
S.C : O(n^2)

Approach 2 - Using Bottom Up (Elaborated for simplicity) - My favourite BluePrint for solving palindromic DP problems
T.C : O(n^2)
S.C : O(n^2)


✨ Timelines✨
00:00 - Introduction
2:34 - Recursion + Memoization
19:54 - Coding Recursion + Memoization
24:05 - Bottom Up (Blue Print)
42:29 - Coding Bottom Up (Blue Print)

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #newyear2024