0091 - Decode Ways

[neaGaze]

Description of the Problem

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

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

Given a non-empty string containing only digits, determine the total number of ways to decode it.

The answer is guaranteed to fit in a 32-bit integer.

Code

class Solution:
    def numDecodings(self, s: str) -> int:

Link To The LeetCode Problem

LeetCode

[reach-the-sky]

Can you assign this to me.