Count Ways to Score in a Game
Explore how to count the number of ways to reach a target score using scores of 1, 2, or 4 points. Understand the naive recursive solution and its inefficiencies, then learn to optimize it using dynamic programming techniques, including memoization and tabulation, to improve both time and space complexity effectively.
Statement
Suppose there is a game where a player can score either
Note: You may assume that you can use a specific score as many times as you want. Additionally, the order in which we select scores from the list is significant.
Let's say the total points to be earned are
and , in three turns: . and then a , in two turns: . and then a , in two turns: ...