Vintimilla

1) Coin Change
Given a value N, if we want to make change for N cents, and we have infinite supply of
each of S = { S1, S2, .. , Sm} valued coins, how many ways can we make the change? The
order of coins doesn’t matter.
Vintimilla

2) Count number of ways to reach a given

score in a game
Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total
score n, find number of ways to reach the given score.
Vintimilla

3) Maximum path sum in a triangle.

We have given numbers in form of triangle, by starting at the top of the triangle and moving
to adjacent numbers on the row below, find the maximum total from top to bottom.