← Questions
Valid palindrome after deleting at most k characters
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return whether a string can become a palindrome by deleting at most k characters. Relate it to the longest palindromic subsequence and give the time and space of your solution.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding