Dynamic Programming Series #2: Longest Palindromic Substring

As promised, in this chapter of this series, we shall tackle a problem together using dynamic programming. The problem we are solving is as follows: Given a string s, find the longest palindromic substring in s. You may assume that the maximum leng...