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 🙂

CODE LINK: https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/

Thanks for watching this, here’sThe Video Source. for more go to our blog to see more fav content from the best youtubers.

Try Our Hosting Partners Hostinger.com Today!

Contact Us Now!

You are a:

4 + 4 =