challenge-62

Palindrome with maximum "k" deletions

This problem was asked by Google.

Description

Given a string which we can delete at most k, return whether you can make a palindrome.

Example

Input:
  word = "waterrfetawx"
  k = 2

Output: True # Deleting "f" and "x" gives us a palindrome