Leetcode 1312. Minimum Insertion Steps to Make a String Palindrome

Given a string s, compute the minimum number of character insertions anywhere to make it a palindrome. Key insight: this equals |s| minus the length of the longest palindromic subsequence (or LCS of s and reverse(s)), solvable with O(n^2) dynamic programming.