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.