We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given a string which we can delete at most k, return whether you can make a palindrome.
k
For example, given 'waterrfetawx' and a k of 2, you could delete f and x to get 'waterretaw'.
'waterrfetawx'
2
f
x
'waterretaw'
The text was updated successfully, but these errors were encountered:
Identical to Day 121: #251
Sorry, something went wrong.
vaskoz
Successfully merging a pull request may close this issue.
Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given a string which we can delete at most
k
, return whether you can make a palindrome.For example, given
'waterrfetawx'
and ak
of2
, you could deletef
andx
to get'waterretaw'
.The text was updated successfully, but these errors were encountered: