Valid Palindrome After Deleting at Most K Characters

Given a string s and a non-negative integer k, determine whether s can become a palindrome after deleting at most k characters. The relative order of remaining characters must be preserved.

T...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: