Minimum Insertions to Make String Palindrome

Short summary

Solve minimum palindrome insertions by finding the longest palindromic subsequence using DP. The insight: only characters outside the LPS need insertion, so answer = string length minus LPS length. LPS equals the longest common subsequence between the string and its reverse, computable in O(N²) time.

• •Reframe the problem: find characters NOT in the longest palindromic subsequence (LPS)
• •LPS can be computed as LCS between original string and its reverse
• •Optimized DP solution achieves O(N²) time, vastly better than naive exponential recursion

Generated with AI, which can make mistakes.