K-Palindrome Problem Statement

Determine whether a given string str can be considered a K-Palindrome.

A string is considered a K-Palindrome if it can be transformed into a palindrome after removing up to ‘k’ characters.

Example:

Input:

str = "ababba", k = 3

Output:

True

Explanation:

If we remove one ‘b’ from the 3rd position, the string becomes "ababa", which is a palindrome. Thus, the output is True.

Constraints:

• 1 <= T <= 10
• 1 <= |str| <= 1000
• 1 <= k <= 30
• Time limit: 1 sec