If the difference between longest palindromic subsequence and the original String is less than equal to k , then the String is k - palindrome
return ( n - lps <= k ) ; } static String reverse ( String input ) { char [ ] temparray = input . ToCharArray ( ) ; int left , right = 0 ; right = temparray . Length - 1 ; for ( left = 0 ; left < right ; left ++ , right -- ) {