Given a digit sequence **S**, the task is to find the number of possible decodings of the given digit sequence where 1 represents ‘A’, 2 represents ‘B’ … and so on up to 26, where 26 represents ‘Z’.

**Examples:**

Input:S = “121”

Output:3

The possible decodings are “ABA”, “AU”, “LA”

Input:S = “1234”

Output:3

The possible decodings are “ABCD”, “LCD”, “AWD”

**Approach:** In order to solve this problem in O(N) time complexity, Dynamic Programming is used. And in order to reduce the auxiliary space complexity to O(1), we use the space optimized version of recurrence relation discussed in the Fibonacci Number Post.

Similar to the Fibonacci Numbers, the key observations of any current ‘i^{th}‘ index can be calculated using its previous two indices. So the Recurrence Relation to calculate the i^{th} index can be denoted as

// Condition to check last // digit can be included or not if (digit[i-1] is not '0') count[i] += count[i-1] // Condition to check the last // two digits contribution if (digit[i-2] is 1 or (digit[i-2] is 2 and digit[i-1] is less than 7)) count[i] += count[i-2]

Below is the implementation of the above approach:

## C++

`// C++ implementation to count decodings ` ` ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// A Dynamic Programming based function ` `// to count decodings in digit sequence ` `int` `countDecodingDP(string digits, ` `int` `n) ` `{ ` ` ` `// For base condition "01123" ` ` ` `// should return 0 ` ` ` `if` `(digits[0] == ` `'0'` `) ` ` ` `return` `0; ` ` ` ` ` `int` `count0 = 1, count1 = 1, count2; ` ` ` ` ` `// Using last two calculated values, ` ` ` `// calculate for ith index ` ` ` `for` `(` `int` `i = 2; i <= n; i++) { ` ` ` `count2 = ((` `int` `)(digits[i - 1] != ` `'0'` `) * count1) + ` ` ` `(` `int` `)((digits[i - 2] == ` `'1'` `) or ` ` ` `(digits[i - 2] == ` `'2'` `and ` ` ` `digits[i - 1] < ` `'7'` `)) * count0; ` ` ` `count0 = count1; ` ` ` `count1 = count2; ` ` ` `} ` ` ` ` ` `// Return the required answer ` ` ` `return` `count1; ` `} ` ` ` `// Driver Code ` `int` `main() ` `{ ` ` ` `string digits = ` `"1234"` `; ` ` ` `int` `n = digits.size(); ` ` ` ` ` `// Function call ` ` ` `cout << countDecodingDP(digits, n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

**Output:**

3

**Time Complexity:** O(N)

**Auxiliary Space Complexity:** O(1)

**Related Article:** Count Possible Decodings of a given Digit Sequence

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Count the number of ways to tile the floor of size n x m using 1 x m size tiles
- Space and time efficient Binomial Coefficient
- Count all possible paths from top left to bottom right of a mXn matrix
- Count number of binary strings without consecutive 1's
- Count Possible Decodings of a given Digit Sequence
- Count all possible walks from a source to a destination with exactly k edges
- Count ways to reach the n'th stair
- Count number of ways to reach a given score in a game
- Count possible ways to construct buildings
- Count numbers from 1 to n that have 4 as a digit
- Count of n digit numbers whose sum of digits equals to given sum
- Count total number of N digit numbers such that the difference between sum of even and odd digits is 1
- Bitmasking and Dynamic Programming | Set 1 (Count ways to assign unique cap to every person)
- Count even length binary sequences with same sum of first and second half bits
- Count number of ways to cover a distance
- Count number of ways to partition a set into k subsets
- Count number of paths with at-most k turns
- Count Derangements (Permutation such that no element appears in its original position)
- Count number of subsets having a particular XOR value
- Weighted Job Scheduling in O(n Log n) time

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.