Camel Case Complication

CodeChefOpen on judge ↗

Mr. Hola types a sequence of words in CamelCase as a string of letters. The String having the following properties: - It is a concatenation of one or more words consisting of English letters. - All letters in the first word are lowercase. - For each of the subsequent words, the first letter is uppercase and rest of the letters are lowercase. Given string s, print the number of words in s on a

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI