title: Google Case Given Sentence
signature: function google_case_given_sentence(s)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(s, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(s), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver("TEYndweqZA", "tEYNDWEQZA");
      @printf("TEST-0...%s\n",result);
      
      result = driver("01865", "01865");
      @printf("TEST-1...%s\n",result);
      
      result = driver("11001100", "11001100");
      @printf("TEST-2...%s\n",result);
      
      result = driver("CzwznJmQet", "cZWZNJMQET");
      @printf("TEST-3...%s\n",result);
      
      result = driver("318305446", "318305446");
      @printf("TEST-4...%s\n",result);
      
      result = driver("0000001111110", "0000001111110");
      @printf("TEST-5...%s\n",result);
      
      result = driver("yzT", "yZT");
      @printf("TEST-6...%s\n",result);
      
      result = driver("38630230", "38630230");
      @printf("TEST-7...%s\n",result);
      
      result = driver("01101", "01101");
      @printf("TEST-8...%s\n",result);
      
      result = driver("zoizI", "zOIZI");
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
source_py: def google_case_given_sentence(s):
      n = len(s)
      s1 = ''
      s1 = (s1 + s[0].lower())
      i = 1
      while (i < n):
          if ((s[i] == ' ') and (i <= n)):
              s1 = ((s1 + ' ') + s[(i + 1)].lower())
              i = (i + 1)
          else:
              s1 = (s1 + s[i].upper())
          i = (i + 1)
      return s1
source_cpp: string google_case_given_sentence(string s) {
    int n = s . length ( );
    s [ 0 ] = tolower ( s [ 0 ] );
    for ( int i = 1;
    i < n;
    i ++ ) {
      if ( s [ i ] == ' ' && i < n ) {
        s [ i + 1 ] = tolower ( s [ i + 1 ] );
        i ++;
      }
      else s [ i ] = toupper ( s [ i ] );
    }
    return s;
  }