Longest palindromic substring | Dynamic programming

Опубликовано: 09 Октябрь 2019
на канале: Techdose
398,060
7.4k

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...


Смотрите видео Longest palindromic substring | Dynamic programming онлайн без регистрации, длительностью часов минут секунд в хорошем качестве. Это видео добавил пользователь Techdose 09 Октябрь 2019, не забудьте поделиться им ссылкой с друзьями и знакомыми, на нашем сайте его посмотрели 398,060 раз и оно понравилось 7.4 тысяч людям.