Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Decode Ways
Coding · Dynamic Programming · String
- Count Distinct Ways to Cross a River with Jumps of Up to 3
Coding
- Count Number of Ways to Place Houses
Coding
- Count Ways To Build Good Strings
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 639. Decode Ways II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source