Longest palindromic substring | Dynamic programming

This video explains how to find longest palindromic substring from a given string. This is a very frequently asked programming interview and coding round question. I have explained two techniques here. One is bruteforce by generating all possible substrings and checking if it is palindrome or not and storing the longest substring which is a palindrome found. My audio quality is bad due to damaged-mic so kindly bear for this video. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[techdoseu]

🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]

[hey.............]

Kudos for going through the whole input string instead of saying so on and so forth👍

[thecritiquer]

I knew from reading other explanations that it was the explanation itself that was hindering everyone including myself. You are so far the only person that actually explained how the dynamic approach works clearly.

[KushalBhatia]

Please give this man a medal.
Thank you for going through the whole string dry run

[ragas_]

Fact : This guy alone is responsible for more placement offers than all college professors combined !
Change my mind

[jrajesh]

What a great presentation and explanation ! You are just going frame by frame and bringing clarity all the way down deep! Keep doing such great videos for demystifying complex algos.

[sathvikrijo]

One of the best explanations for this question, for dp beginners🎉🍾 thanks a lot man💐👍

[sam_s]

Thanks a million for making such an incredible explanation for a GFG code. Sometimes they have good codes, but no explanations or the explanations are not clear enough. This is just so well explained. All your videos are helping so many of us. Keep up the great work!

[aslanfeng]

THE best explanation I’ve heard so far!!!

[bookalicious]

Excellent explanation ! As a newbie in dp i really was struggling to understand this concept but you made my life easier !!!

[utkarshsrivastava]

You are just explaining the whole concept with patience . thanku for clearing me this algo, you are just my fav man❤️

[ayyappareddy]

I watched lot of videos for this problem but no one explained like the way you explained.thank you sir

[JSInstructor]

Thank you so much for the video! I hadn't truly understood the dynamic programming approach to the max palindrome substring problem until I watched your explanation. Thanks again!

[yuganderkrishansingh]

Bro this is the best explanation for the question and I finally understood it. Explaining is an art and making others understand is a superpower and you clearly has it. The video was crisp and so easy to follow. Just loved it.
Pls keep making more videos. I know you might be busy with other stuff(I am sure u might be working for some top notch company and if not then you are surely going to be very soon) but pls keep making more videos.

[abdallaalhag]

I really love how you draw and go through the DP table. I don't see many people explain it that way and it can be very hard to visual or trace through at first. Thanks So much!

[paulcurran]

Thank you for this, I've had trouble understanding this algorithm in other videos but this is the best explanation I've seen.

[meetmodi]

New to DP. Was trying to get this approach for 2 hrs.Thanks alot for the explanation.Explained so well, no need to upload the code!

[sumit]

Now i know why your video is on the top when searched for this problem. Thanks for such good content.

[ayeshaadhikari]

No amount of thanks is ever going to repay the help you're lending us :) Thanks a tonne sir! Keep growing

[chillegaming]

This is gold! Thank you for that clear explanation.. your DP series is the best out there!