Company: Goldman sachs_4nov
Difficulty: medium
Alphanumeric Combinations Problem Description John is teaching his son Rob English alphabet and number counting. He represents 'a' as the 1st character, 'b' as the 2nd character up to 'z' as the 26th character. John says 'kite' can be represented as '119205'. The 11th character is 'k', 9th character is 'i', 20th character is 't' and 5th character is 'e'. Rob being smarter than him, says '119205' can also mean 'aaite' (1)(1)(9)(20)(5), 'aste'(1)(19)(20)(5), etc. Now being enthusiastic about it, John wants to know given a string of length n containing digits from 0 to 9, how many such words are possible. Input Format You are given a string S containing characters from 0-9. You have to find how many such words are possible for that given number sequence. Output Format A single integer returning the number of words. If there are no possible combinations output will be 0. Complete the 'calculatePossibleCombinations' function below. The function is expected to return a LONG_INTEGER. The func