Skip to content

Files

Latest commit

fb3e0f1 · Nov 5, 2019

History

History
12 lines (6 loc) · 441 Bytes

README.md

File metadata and controls

12 lines (6 loc) · 441 Bytes

Daily Coding Problem: Problem #7 [Medium]

Good morning! Here's your coding interview problem for today.

This problem was asked by Facebook.

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.