We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. CamelCase
  5. Discussions

CamelCase

  • yashdeliwala10
     + 0 comments

    my cpp solution for this programme

    int camelcase(string s) {

    int count=1;  //  count=1 for min 1 word
for(int i = 0;i <s.size();i++){ // loop lessthan size
    if(s[i] < 'a')   //if less than lowescase than count++
    count++;
}

return count;

    }