You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.
Hackerrank - CamelCase Solution

Hackerrank - CamelCase Solution

Beeze Aal
Beeze Aal

Alice wrote a sequence of words in CamelCase as a string of letters, , 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 , print the number of words in  on a new line.

For example, . There are  words in the string.

Function Description

Complete the camelcase function in the editor below. It must return the integer number of words in the input string.

camelcase has the following parameter(s):

  • s: the string to analyze

Input Format

A single line containing string .


Output Format

Print the number of words in string .

Sample Input


Sample Output



String  contains five words:

  1. save
  2. Changes
  3. In
  4. The
  5. Editor

Thus, we print  on a new line.

Need help? Try this problem first to get familiar with HackerRank environment.

Solution in Python

print(len([1 for i in input() if i.isupper()])+1)