Problem 1A:

Create a method called toCamelCase that accepts a string as an input and outputs that string in camelCase.

(i.e. no spaces and all words capitalized except the first. thisIsACamelCasedSentence)

This must be achieved recursively. The method does not have to handle punctuation, but must be able to handle any number of spaces between words, or at the beginning and/or end of the input string.

Example

input:

pErHaPs I hAVe wRitten a Sentence LiKE this one

Output:

perhapsIHaveWrittenASentenceLikeThisOne