Palindromes
Validating K-Palindromes
Given a string s and an integer k, find out if the given string is a k-palindrome or not. A string is a k-palindrome if it can be transformed into a palindrome by removing at most k characters from it.
ReadMinimum Palindromic Partitions
Given a string, split it into as few strings as possible such that each string is a palindrome.
Read