bugl
bugl
HomeLearnPatternsPathsSearchPremium
HomeLearnPatternsPaths
Hard2-D Dynamic ProgrammingLC 1216

Valid Palindrome III

Given a string s and an integer k, return true if s is a k\-palindrome. A string is k\-palindrome if it can be transformed into a palindrome by removing at most k characters from it.

Asked at 1 company
Facebook
Hints
  • 1.Think about which data structure fits best
  • 2.Consider the time complexity of your approach
  • 3.Look for patterns in the constraints
LeetCode