title: Nth Even Length Palindrome
signature: nth_even_length_palindrome <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          "lSUhEvxcgfI", 
          "lSUhEvxcgfIIfgcxvEhUSl"
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          "77329283", 
          "7732928338292377"
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          "010111111", 
          "010111111111111010"
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          "Stazb", 
          "StazbbzatS"
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          "0702", 
          "07022070"
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          "01111111", 
          "0111111111111110"
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          "a", 
          "aa"
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          "rznb", 
          "rznbbnzr"
      )))
  
  }
  
  main()
source_py: def nth_even_length_palindrome(n):
      res = n
      for j in range((len(n) - 1), (- 1), (- 1)):
          res += n[j]
      return res
source_cpp: string nth_even_length_palindrome(string n) {
    string res = n;
    for ( int j = n . length ( ) - 1;
    j >= 0;
    -- j ) res += n [ j ];
    return res;
  }