Camel Case Hackerrank Solution in Java | Camelcase Coding Question in Java

Camel Case Hackerrank: There is a sequence of words in CamelCase as a string of letters, s , 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 s , determine the number of words in s. Example: s=oneTwoThree There are 3 words in the string : 'one', 'Two', 'Three'. Problem Link: https://www.hackerrank.com/challenges/camelcase/problem