91. Decode Ways

My Submissions
Total Accepted: 60669 Total Submissions: 355037 Difficulty: Medium

A message containing letters from A-Z is being encoded to numbers using the following mapping:

'A' -> 1
'B' -> 2
...
'Z' -> 26

Given an encoded message containing digits, determine the total number of ways to decode it.

For example,
Given encoded message "12", it could be decoded as "AB" (1 2) or "L" (12).

The number of ways decoding "12" is 2.

Subscribe to see which companies asked this question

Have you met this question in a real interview?
Yes
No
When did you meet this question?
1 week ago
1 month ago
3 months ago
6 months ago
More than 6 months ago
How long have you been interviewing?
Not yet started
1 month
3 months
6 months
More than 6 months
Which company asked you this question?
Adobe
Airbnb
Alation
Alibaba
Amazon
Apple
Arista
Baidu
Blend Labs
Blizzard
Bloomberg
Box
Bungie
Cisco
Conviva
Coursera
CreditEase
Deutsche Bank
Dropbox
eBay
Electronic Arts
EMC
Epic Systems
Expedia
Facebook
Flipkart
Fortinet
FreeWheel
Goldman Sachs
Google
GrabTaxi
Groupon
Hedvig
Hulu
Intel
Jane Street
JPMorgan
Jump Trading
Lending Club
LinkedIn
LiveRamp
Marvel
Matlab
McKesson
Microsoft
Morgan Stanley
Nvidia
Oracle
Orbitz
Palantir
Paypal
Pinterest
Pocket Gems
Qualtrics
Qumulo
Quora
Rackspace
Salesforce
Sina
Snapchat
Square
Sumologic
Symantec
Tencent
TinyCo
Tradeshift
TripAdvisor
Twitter
Two Sigma
Uber
VMware
Walmart
Yahoo!
Yandex
Yelp
Zenefits
Zynga

Discuss


You have not signed in, cannot submit your code.
Submit failed, try again please.

Submission Result: {[{ statusText }]} More Details

Share your acceptance!

Runtime Error Message: {[{ runtimeError }]}
Last executed input: {[{ lastExecutedTestCase }]}
Stdout: {[{ resultStdOutput }]}
{[{ resultCodeOutput }]}
Input: {[{ resultWaTestCaseInput | escape }]}
Output: {[{ resultWaTestCaseOutput | escape }]}
Expected: {[{ resultWaTestCaseExpected | escape }]}
Stdout: {[{ resultStdOutput | escape }]}
Send Feedback