Hello everyone. Today is the Day 7 of the #100DaysOfCodeChallenge. And it's a week!!!! Received a problem previously asked by Facebook with a hard tag to it.

The Question On Day #6:

Given the mapping a = 1, b = 2, ... z = 26, and an encoded message, count the number of ways it can be decoded.

For example, the message '111' would give 3, since it could be decoded as 'aaa', 'ka', and 'ak'.

You can assume that the messages are decodable. For example, '001' is not allowed.

Algorithm

The algorithm is similar to the concept behind fibonacci series. For every increase in the value of n is fibonacci we added it to the n-1 sum.
Similarly, for every increase in the length of the message, we add a particular value to the number of possible ways, based on certain conditions.
Points to check:
- a 1-digit number is considered a message only if it is greater than 0, because a is represented by 1 according to the question.
- a 2-digit number is considered a message only if it has 2 in the ten's place and digit<7 in the one's place or 1 in ten's place and any digit in one's place.

Python Code

https://gist.github.com/nmreddy1911/b68ce4c953a8ca458e70e18b04fce539

Output Number Of Ways: 3

Visualiser

You can look into the visualiser to understand the BTS of the logic here.

Feel free to reach out for any query clearance.

Thanks and cheers:)

Day #7: Number of possible decodable messages

Comments

100 Days Of Code

Day #8: Number Of Unival Trees Using Python

More from this blog

DIY Portfolio: Unleashing Your Professional Story Online

Building Code Runner - Part #2 : Node.js Backend With Express Server and JDoodle API

Building Code Runner - Part #1 : Creating An Overview And MERN Project Setup With PNPM and Vite

Building Code Runner - Part #0

Day #8: Number Of Unival Trees Using Python

The Question On Day #6:

Algorithm

Python Code

Visualiser

Command Palette

Comments

100 Days Of Code

Day #8: Number Of Unival Trees Using Python

More from this blog

The Question On Day #6:

Algorithm

Python Code

Visualiser