title: Decode Median String Original String
signature: decodeMedianStringOriginalString :: String -> String
  decodeMedianStringOriginalString s = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: String -> String -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: String -> String -> String
  driver s expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME s) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (" EgvQCeqYpZtv") ("tpqCvE gQeYZv") )
  
      printf "TEST-1...%s\n" (driver ("488540") ("484850") )
  
      printf "TEST-2...%s\n" (driver ("0000101010111") ("1000000011111") )
  
      printf "TEST-3...%s\n" (driver ("syw") ("ysw") )
  
      printf "TEST-4...%s\n" (driver ("402355") ("524035") )
  
      printf "TEST-5...%s\n" (driver ("0") ("0") )
  
      printf "TEST-6...%s\n" (driver ("wmHMlAtq") ("tlHwmMAq") )
  
      printf "TEST-7...%s\n" (driver ("7962") ("6792") )
  
      printf "TEST-8...%s\n" (driver ("111111") ("111111") )
  
      printf "TEST-9...%s\n" (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;
  }