Valid Palindrome After Deleting at Most K Characters

meta

Problem

Given a string s and an integer k, determine whether s can become a palindrome after deleting at most k characters.

Input

  • Line 1: string s.
  • Line 2: integer k.

Outp...

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: