Longest Palindromic Subsequence || Dynamic Programming || Recursion || Top-Down || Bottom Up

In this video, I'll talk about how to solve 516. Longest Palindromic Subsequence - [Recursion - Top Down - Bottom Up - Bottom Up O(n) ]

Longest Palindromic Subsequence || Dynamic Programming || Recursion || Top-Down || Bottom Up

Let's Connect:

Resources you can try:

🎥Channel Playlists

About Channel:
We teach about how you can grow in life & educate about programming in Fun & Intuitional way.

About Me:
I am Aryan Mittal - a Software Engineer, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)

✨ Timelines✨
0:00 - Recursive Approach
3:42 - Top Down Approach
14:07 - Bottom Up Approach
23:15 - Bottom Up Optimized Approach

✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[Anonymous-lbmc]

The way you are explaining is very engaging. Glad that you are feeling very excited while teaching!

[sairajpawar]

by using top down approach i get tle on case 71 why? program take n^2 time complexity in that method right?

[satyamgupta]

thanks aryan for such a detailed video (I have just covered dsa till recursion and backtracking topic), don't know much about memoization, tabulation etc. but still watched the video even though after memoization part didn't understand anything still just for ur efforts I watched the whole video.

Can u suggest some good resources on dp (I want to master these topics like dp, recursion, backtracking, tabulation) just like u. How u master these topics kindly please share those resources with me.

[shivamnegi]

ganda samjhaya last wala optimisatin .. string likhke samjhana chahiye . ache se .. bohot confusion hora h usme .