Longest Palindromic Subsequence | Recursion + Memoisation + Tabulation | DP-25

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

Welcome to my brand new Dynamic Programming playlist! 🎉 In this series, we'll dive deep into the world of dynamic programming and explore various problem-solving techniques.

📚 GitHub Repository:

👍 Don't forget to like, share, and subscribe to our channel for more exciting
content on algorithms, data structures, and problem-solving! 🔔

And yes, the outro music is produced by me🎶😄

🔗Connect with me:

Problem Statement 0:00
Recursion Approach 03:53
Recursion Code 23:28
Memoisation Code 26:08
Tabulation Approach 28:11
Tabulation Code Gap Strategy 32:56
Announcement 35:40
Рекомендации по теме
Комментарии
Автор

Just found your channel and its pretty clear ! I love this technique. Other youtubers use the trick LCS w/ reversed string, but i don't know how anyone can come up with that.

This method feels more intuitive. What is the time complexity for the top-down dp?

Moch
Автор

Thanks Man!

500 kya 500k deserve karta aapka content

CodingJoySoul
Автор

Very nice explanation sir.
At the moment I have 0 doubts here.

rajeevkumar-weky