A subsequence keeps order but may skip characters. Return the length of the longest palindromic subsequence of s using interval DP (O(n²) time).
Also implement min_insertions(s): the minimum number of characters to insert anywhere to make s a palindrome (hint: it's related).