Similar to #91 Decode ways, instead of each number (1-26) representing a char, given String s and int k, where each integer from 1 to k represent a "word", e.g. 1: "hello", 2:"world", ... k: "bye". What is the total number of different ways to decode the message s. So here s is a string of numbers, without leading 0.

So basically #91 Decode ways, but instead of 26 "possibilities of characters", there are k possibilities.

Anyone know how to solve this?