Hard Problemspalindromecountinginterval
Palindromic Substring Count
Given a string, count how many of its contiguous substrings read the same forwards and backwards. Identical characters appearing at different positions are counted as separate substrings.
Do this lesson first: longest common subsequenceThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself. That is the whole exercise.