DIY: Decode Ways

Solve the interview question "Decode Ways" in this lesson.

Problem statement

A message containing the letters from A-Z can be encoded into a string of numbers, using the following mapping:

'A' -> "1" 'B' -> "2" ... 'Z' -> "26" 

To decode an encoded message, all the digits must be grouped and then mapped back into letters, using the reverse of the mapping ...