Search
⌘K
Get Premium
Leetcode 639. Decode Ways II
Count the number of ways to decode a string of digits and '*' (where '*' can be any digit '1'–'9') into letters using single- and valid two-digit mappings (1–26), handling combinatorial cases from '*' and returning the result modulo 10^9+7. This is solved with dynamic programming that accumulates ways based on single- and pair- character interpretations.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.