Solution: Decode Ways

Let's solve the Decode Ways problem using the Dynamic Programming pattern.

Statement

Given a string that has only positive digits, your task is to decode the string and determine the number of possible ways to decode it.

Consider the input string as an encoded message, where each digit in the string represents an alphabet from A to Z. For reference, let’s look at the mapping below:

"1" represents "A"

"2" represents "B"

"3" represents "C"

\dots

"26" represents "Z"

How to perform the decode operation?

To decode an encoded message, we have to check whether or not each digit in the string can be mapped onto the mapping above. There can be multiple ways to decode a string.

For example, the string "231012" can be decoded in the following ways:

  • Option 1 \rightarrow "2", "3", "10", "1", "2" \rightarrow "B", "C", "J", "A", "B"

  • Option 2 \rightarrow "2", "3", "10", "12" \rightarrow "B", "C", "J", "L"

  • Option 3 \rightarrow "23", "10", "1", "2" \rightarrow "W", "J", "A", "B"

  • Option 4 \rightarrow "23", "10", "12" \rightarrow "W", "J", "L"

Note: In the mapping above, we haven't included "01" since it's an invalid mapping. It cannot be mapped onto "A" since "01" and "1" are different.

Constraints:

  • 11 \leq decodeStr.length 100\leq 100

  • The string decodeStr contains only digits and may contain leading zero(s).

Solution

The idea is to analyze the string of digits and break it down in such a manner that at each iteration, the string can be decoded using either one digit (19)(1-9) or two digits (1026)(10-26). To further explain, let’s look at the example provided in the problem statement.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.