title: Check If String Remains Palindrome After Removing Given Number Of Characters
signature: checkIfStringRemainsPalindromeAfterRemovingGivenNumberOfCharacters :: String -> Integer -> Bool
  checkIfStringRemainsPalindromeAfterRemovingGivenNumberOfCharacters str n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Bool -> Bool -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: String -> Integer -> Bool -> String
  driver str n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME str n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ("ZCoQhuM") (2) (True) )
  
      printf "TEST-1...%s\n" (driver ("7437725") (53) (False) )
  
      printf "TEST-2...%s\n" (driver ("11") (30) (False) )
  
      printf "TEST-3...%s\n" (driver ("buGlvR") (1) (True) )
  
      printf "TEST-4...%s\n" (driver ("9") (92) (False) )
  
      printf "TEST-5...%s\n" (driver ("101101010110") (3) (True) )
  
      printf "TEST-6...%s\n" (driver ("YguiM") (18) (False) )
  
      printf "TEST-7...%s\n" (driver ("8198") (90) (False) )
  
      printf "TEST-8...%s\n" (driver ("11101") (71) (False) )
  
      printf "TEST-9...%s\n" (driver ("hUInqJXNdbfP") (4) (True) )
  
source_py: def check_if_string_remains_palindrome_after_removing_given_number_of_characters(str, n):
      l = len(str)
      if (l >= n):
          return True
      return False
source_cpp: bool check_if_string_remains_palindrome_after_removing_given_number_of_characters(string str, int n) {
    int len = str . length ( );
    if ( len >= n ) return true;
    return false;
  }