title: Nth Even Length Palindrome
signature: function nthEvenLengthPalindrome($n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        "lSUhEvxcgfI", 
        "lSUhEvxcgfIIfgcxvEhUSl"));
      
      printf("TEST-1...%s\n",driver(
        "77329283", 
        "7732928338292377"));
      
      printf("TEST-2...%s\n",driver(
        "010111111", 
        "010111111111111010"));
      
      printf("TEST-3...%s\n",driver(
        "Stazb", 
        "StazbbzatS"));
      
      printf("TEST-4...%s\n",driver(
        "0702", 
        "07022070"));
      
      printf("TEST-5...%s\n",driver(
        "01111111", 
        "0111111111111110"));
      
      printf("TEST-6...%s\n",driver(
        "a", 
        "aa"));
      
      printf("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;
  }