Interval Dynamic Programming: Classic Problems and Solutions
Progress: Dynamic Programming - Linear DP, Knapsack, Interval DP
Merging Palindromic Substrings
Tags: Interval DP
Foundation - Longest Palindromic Substring
Problem: Given a string (S), find the length of its longest palindromic substring.
Approach: A longer palindrome can always be constructed by adding identical characters to both ends of a s ...
Posted on Thu, 14 May 2026 05:56:34 +0000 by sb