Skip to content

problem17.md

Latest commit

 

History

History
15 lines (11 loc) · 484 Bytes

problem17.md

File metadata and controls

15 lines (11 loc) · 484 Bytes

Problem 17: The Decode Counter (Decode Ways)

Problem Statement

A message containing letters from A-Z can be encoded as: 'A' -> "1", 'B' -> "2", ..., 'Z' -> "26". Given a string s containing only digits, return the number of ways to decode it.

Input Format

  • A string s containing only digits.

Constraints

  • 1 <= s.length <= 100

Example

Input: s = "226"
Output: 3
Explanation: "226" could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6).