title: Decode Median String Original String
signature: def decodeMedianStringOriginalString(s: 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(s: String, expected: String): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(s),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        " EgvQCeqYpZtv", 
        "tpqCvE gQeYZv"    
      )}")   
  
  
      println(s"TEST-1...${driver(
        "488540", 
        "484850"    
      )}")   
  
  
      println(s"TEST-2...${driver(
        "0000101010111", 
        "1000000011111"    
      )}")   
  
  
      println(s"TEST-3...${driver(
        "syw", 
        "ysw"    
      )}")   
  
  
      println(s"TEST-4...${driver(
        "402355", 
        "524035"    
      )}")   
  
  
      println(s"TEST-5...${driver(
        "0", 
        "0"    
      )}")   
  
  
      println(s"TEST-6...${driver(
        "wmHMlAtq", 
        "tlHwmMAq"    
      )}")   
  
  
      println(s"TEST-7...${driver(
        "7962", 
        "6792"    
      )}")   
  
  
      println(s"TEST-8...${driver(
        "111111", 
        "111111"    
      )}")   
  
  
      println(s"TEST-9...${driver(
        "UbgRGDquop", 
        "oqGgUbRDup"    
      )}")   
  
  }
  
source_py: def decode_median_string_original_string(s):
      l = len(s)
      s1 = ''
      if ((l % 2) == 0):
          isEven = True
      else:
          isEven = False
      for i in range(0, l, 2):
          if isEven:
              s1 = (s[i] + s1)
              s1 += s[(i + 1)]
          elif ((l - i) > 1):
              s1 += s[i]
              s1 = (s[(i + 1)] + s1)
          else:
              s1 += s[i]
      return s1
source_cpp: string decode_median_string_original_string(string s) {
    int l = s . length ( );
    string s1 = "";
    bool isEven = ( l % 2 == 0 ) ? true : false;
    for ( int i = 0;
    i < l;
    i += 2 ) {
      if ( isEven ) {
        s1 = s [ i ] + s1;
        s1 += s [ i + 1 ];
      }
      else {
        if ( l - i > 1 ) {
          s1 += s [ i ];
          s1 = s [ i + 1 ] + s1;
        }
        else {
          s1 += s [ i ];
        }
      }
    }
    return s1;
  }