Longest Palindromic Substring using Dynamic Programming

Given a string, find the longest substring which is a palindrome.  Examples:  Input: Given string :”forgeeksskeegfor”, Output: “geeksskeeg”.Input: Given string :”Geeks”, Output: “ee”. Recommended Practice … Continue reading Longest Palindromic Substring using Dynamic Programming