Google | Onsite | Min Deletions to Make Palindrome
12680

Question:
https://leetcode.com/problems/valid-palindrome

Follow-up:
Find minimum number of deletions required to convert a string into a palindrome.

Example 1:

Input: "ababa"
Output: 0

Example 2:

Input: "abcdba"
Output: 1
Explanation: remove 'c' or 'd'

Example 3:

Input: "aebcbda"
Output: 2
Explanation: remove 'e' and 'd'
Related problems
Comments (22)