Valid palindrome III
Return whether a string can become a palindrome by deleting at most k characters. Relate it to the longest palindromic subsequence and solve it with dynamic programming.
MetaTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.