Grokking Coding Mock Interview
Ask Author
Back to course home

0% completed

Vote For New Content

Solution: Valid Palindrome III
Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Problem Statement

Given a string s and integer k, return true if string can be converted into the palindromic string after removing at most k characters. Otherwise, return false.

Examples

  • Example 1:

    • Input: s = "rdar", k = 1
    • Expected Output: true
    • Justification: We can make rdar to palindromic by removing either d or a character.

  • Example 2:

    • Input: s = "abracadabra", k = 5
    • Expected Output: true

.....

.....

.....

Like the course? Get enrolled and start learning!

Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible