All Questions
1 question
4votes
1answer
245views
Return whether a string is a palindrome if you can delete at most k elements
The task: Given a string which we can delete at most k, return whether you can make a palindrome. For example, given 'waterrfetawx' and a k of 2, you could delete f and x to get 'waterretaw'...
- 3,981
