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/
Видео Longest palindromic substring | Dynamic programming канала TECH DOSE
CODE LINK: https://www.geeksforgeeks.org/longest-palindrome-substring-set-1/
Видео Longest palindromic substring | Dynamic programming канала TECH DOSE
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Minimum edit distance | Dynamic programming | BacktrackingLeetCode 5. Longest Palindromic Substring (Algorithm Explained)26 Longest Palindromic SubsequenceLeetcode problem Longest Palindromic Substring (two solutions)Longest palindrome substring - LeetCode Interview Coding Challenge [Java Brains]Longest Palindromic SubsequenceLongest common substring | Dynamic programming4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming🔴Best resource for interview preparation | Avoid these mistakesFind if one string is a rotation of another stringLongest Palindromic Substring O(N) Manacher's AlgorithmLongest common subsequence | Leetcode #1143Longest Palindromic Subsequence and it's Length (ALGORITHM -DYNAMIC PROGRAMMING)Longest Palindromic Substring - Python - Leetcode 5Trapping Rainwater Problem | Leetcode #42Count Palindromic Substrings Dynamic Programming | Leetcode#647 Solution in JAVALongest Repeating Subsequence | Dynamic Programming | LCSLongest increasing subsequenceLongest Common Subsequence (2 Strings) - Dynamic Programming & Competing Subproblems