Consider how the numbers on a mobile phone's keypad are mapped to letters. Given a number as the input, generate all possible alphabetical strings that it can represent.
If anyone can just suggest the logic and I can try myself then.
A thought for a recursive solution: A set of strings for a given number N with N digits, N=N0N1N2...Nk, can be seen as all possible characters for N0 concatenated with all strings for the number N*=N1N2...Nk