title: Google Case Given Sentence
signature: googleCaseGivenSentence(s) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(String actual, String expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(s, String expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(s), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          "TEYndweqZA", 
          "tEYNDWEQZA")
      }");
  
      print("TEST-1...${driver(
          "01865", 
          "01865")
      }");
  
      print("TEST-2...${driver(
          "11001100", 
          "11001100")
      }");
  
      print("TEST-3...${driver(
          "CzwznJmQet", 
          "cZWZNJMQET")
      }");
  
      print("TEST-4...${driver(
          "318305446", 
          "318305446")
      }");
  
      print("TEST-5...${driver(
          "0000001111110", 
          "0000001111110")
      }");
  
      print("TEST-6...${driver(
          "yzT", 
          "yZT")
      }");
  
      print("TEST-7...${driver(
          "38630230", 
          "38630230")
      }");
  
      print("TEST-8...${driver(
          "01101", 
          "01101")
      }");
  
      print("TEST-9...${driver(
          "zoizI", 
          "zOIZI")
      }");
  
      return 0;
  }
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;
  }