Longest Palindromic Subsequence Dynamic Programming Explained with Code

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the problem Longest Palindromic Subsequence using dynamic programming. In this problem,

1. You are given a string str.
2. You are required to print the length of longest palindromic subsequence of string str.

#dp #dynamicprogramming #palindrome

[Akshatved]

I have seen a lot of youtubers teach and even a lot of paid instructors teach. But I haven't seen anyone explaining DP problems so well. I hope you get all the success you deserve.

[SameerShinde-]

This entire video took 41 minutes from scratch to finish. In a real interview as well, this can be explained. Hats off on this explanation and clarity!!

[snehatandri]

Sir aap sachme gifted teacher hai... Teacher sirf vohi log bann sakte hai Jo student ke level pe jaake unko samjha paaye aur aap me ye talent hai. Thank you so much sir!

[harshitha]

41 minutes of honest Content. Your approach to question not only helps to understand the solution to question but also develops the intuition to approach questions. Thanks a lot!!

[adityaojha]

No other can explain this much better than u. Really appreciate your work.

[Ballistic_Bytes]

Ek bar mein samajh aa gaya itna clear explaination tha. Awesome video. Thanks for this

[rushilahuja]

The more videos I watch, the more I start respecting you sirji ! I like the way you explain things sirji ! Massive respect for you !! Hats off and thanks for the great explanation.

[rahulkaswan]

Great Explanation, I can bet that no one could explain this, better than you, after getting your explanation i never needed to see code, saved this for future reference, thanks Sumeet sir for such a wonderful video .

[aniket]

U made my day sir!
U not only explained this well but in general made me realize when to use a 2-D DP table!
Thank u sir!😍
I should pay u my college

[guptapaaras]

Sir after seeing the video of "count of palindromic subeqs". I managed to do this on my own.
Thank you Sir for the hard work.

[amitupadhyay]

Perfect, part one explanation. I used it to create a recursion with memorization and it worked like a charm .

[arpitgupta]

Hat off to you for making such great and detailed videos.

[aakashyadav]

LPS of a string is LCS(string, reverse string) as simple as that.

[HarivanshKripaVlogs]

Your video are guarantee that i will definitely get the approach..!!
Thank You Sir

[spicyedutainment]

Really it's a very awesome video.
Very well explaintaion sir

[ujjvalcodes]

there is a better approach using O(n) space, but I do appreciate your time and effort. Thanks 😃

[talentpicker]

The "else if" part in line no. 16 and 17 are not required. However, the explanation is really awesome. Hats off to you.

[akashmishra]

Thank you Sir, your videos are helping me a lot to prepare for my upcoming placements.

[ashdavv]

Great way to explain the questions !!! Can you provide videos for other questions as well . I found this is the best channel to understand the questions

[paryt]

This video is best for learning part, but just to solve this question I have different approach,
a string is given we make b string by reversing a and then find longest common subsequence between these two strings and we got the length of longest palindromic subsequence