You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNestProblem Set
🔥Decode Ways: Numerical Cipher DPMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak
Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.
MediumDynamic Programming•Acceptance: 34.5%
Decode Ways: Numerical Cipher DP
Targeted in FAANG & Tech OA:AmazonMicrosoftGoogle
Real-World Engineering Context
Used in variable-length prefix code decoders (Huffman coding), telecommunication binary framing, and cryptographic protocol ciphers.
A message containing letters from `A-Z` can be encoded into numbers using the mapping:
'A' -> '1', 'B' -> '2', ..., 'Z' -> '26'.
To decode an encoded message, all the digits must be grouped then mapped back into letters. Given a string `s` containing only digits, return the number of ways to decode it.
Note that `'06'` cannot be decoded into `'F'` because `'06'` is not a valid 2-digit number.
Sample Test Cases
Input: ["12"]
Expected: 2
Input: ["226"]
Expected: 3
Input: ["06"]
Expected: 0
Constraints
- 1 <= s.length <= 100
- s contains only digits and may contain leading zero(s).
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.