Facebook Interview Question: Decode Ways (Java Solution)

Описание: Facebook Interview Question: Decode Ways (Java Solution)

Not employed by dailycodingproblem.com, just a fan.

You can (and should) sign up to receive an email with a coding problem everyday here: https://www.dailycodingproblem.com

You can subscribe to my channel here:    / @dailycodingproblem8346  

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.

Solution was provided by dailycodingproblem.com and is optimized (time complexity: O(n))