title: Nth Even Length Palindrome
signature: def nthEvenLengthPalindrome(n: String) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: String , expected: String): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: String, expected: String): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        "lSUhEvxcgfI", 
        "lSUhEvxcgfIIfgcxvEhUSl"    
      )}")   
  
  
      println(s"TEST-1...${driver(
        "77329283", 
        "7732928338292377"    
      )}")   
  
  
      println(s"TEST-2...${driver(
        "010111111", 
        "010111111111111010"    
      )}")   
  
  
      println(s"TEST-3...${driver(
        "Stazb", 
        "StazbbzatS"    
      )}")   
  
  
      println(s"TEST-4...${driver(
        "0702", 
        "07022070"    
      )}")   
  
  
      println(s"TEST-5...${driver(
        "01111111", 
        "0111111111111110"    
      )}")   
  
  
      println(s"TEST-6...${driver(
        "a", 
        "aa"    
      )}")   
  
  
      println(s"TEST-7...${driver(
        "rznb", 
        "rznbbnzr"    
      )}")   
  
  }
  
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;
  }