This problem was asked by Google.
Given a string which we can delete at most k, return whether you can make a palindrome.
Input:
word = "waterrfetawx"
k = 2
Output: True # Deleting "f" and "x" gives us a palindrome
challenge-62
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||