title: Nth Even Length Palindrome
signature: function nth_even_length_palindrome(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver("lSUhEvxcgfI", "lSUhEvxcgfIIfgcxvEhUSl");
      @printf("TEST-0...%s\n",result);
      
      result = driver("77329283", "7732928338292377");
      @printf("TEST-1...%s\n",result);
      
      result = driver("010111111", "010111111111111010");
      @printf("TEST-2...%s\n",result);
      
      result = driver("Stazb", "StazbbzatS");
      @printf("TEST-3...%s\n",result);
      
      result = driver("0702", "07022070");
      @printf("TEST-4...%s\n",result);
      
      result = driver("01111111", "0111111111111110");
      @printf("TEST-5...%s\n",result);
      
      result = driver("a", "aa");
      @printf("TEST-6...%s\n",result);
      
      result = driver("rznb", "rznbbnzr");
      @printf("TEST-7...%s\n",result);
      
  end
  
  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;
  }