Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Dynamic Programming but also build up problem-solving skills.

In this problem, we are given a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of distinct combinations to reach the given score.

Example :

Input
n = 10
Output
2
Explanation
There are two ways {5,5} and {10}.

Give the problem a try before going through the video. All the best!!!
Problem Link: https://www.geeksforgeeks.org/problems/reach-a-given-score-1587115621/1
Solution IDE Link: https://ide.geeksforgeeks.org/online-cpp-compiler/71eb3e1c-d3e9-4924-86c1-4eca33ef3c3f