Listen "Count Encodings"
Episode Synopsis
1. You are given a string str of digits. (will never start with a 0)
2. You are required to encode the str as per following rules
1 -> a
2 -> b
3 -> c
..
25 -> y
26 -> z
3. You are required to calculate and print the count of encodings for the string str.
For 123 -> there are 3 encodings. abc, aw, lc
For 993 -> there is 1 encoding. iic
For 013 -> This is an invalid input. A string starting with 0 will not be passed.
For 103 -> there is 1 encoding. jc
For 303 -> there are 0 encodings. But such a string maybe passed. In this case
print 0.
Input Format
A string str
Output Format
count of encodings
Constraints
0 < str.length <= 10
Sample Input
123
Sample Output
3
2. You are required to encode the str as per following rules
1 -> a
2 -> b
3 -> c
..
25 -> y
26 -> z
3. You are required to calculate and print the count of encodings for the string str.
For 123 -> there are 3 encodings. abc, aw, lc
For 993 -> there is 1 encoding. iic
For 013 -> This is an invalid input. A string starting with 0 will not be passed.
For 103 -> there is 1 encoding. jc
For 303 -> there are 0 encodings. But such a string maybe passed. In this case
print 0.
Input Format
A string str
Output Format
count of encodings
Constraints
0 < str.length <= 10
Sample Input
123
Sample Output
3
More episodes of the podcast algodextrous
Maximum Sum Non Adjacent Elements
07/08/2021
Count A+B+C+ Subsequences
07/08/2021
Arrange Buildings
23/07/2021
Count Binary Strings
03/07/2021
Fractional Knapsack
31/05/2021
Unbounded Knapsack
31/05/2021
Zero One Knapsack
30/05/2021
Coin Change Permutations
30/05/2021
Coin Change Combination
28/05/2021
ZARZA We are Zarza, the prestigious firm behind major projects in information technology.