C Pseudocode

https://www.hackerrank.com/challenges/camelcase edited, Acua8] Consider 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 the string S, write a functional style (and easily parallelizable) algorithm to compute the number of words in S. Use C-like pseudocode. Feel free to write helper functions when needed. You may assume the following functions are available for you to use: linked_list split(charD string) bool is_lower(char c) . linked_list map(void* function, linked_list data) . void reduce(void* function, linked_list data)