The greedy coins game Dynamic Programming Solution :
Question statement There is a row of 2n coins on the table; each coin can have any positive integer value. Two players alternate turns.
On a player’s … Read More
Puzzle
25 horses 5 tracks Find 3 fastest puzzle
Suppose you have 25 horses, and you want to pick the fastest 3 horses out of those 25. In each race, only 5 horses can run at the same time in a race because there
building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building
Given n stairs, how many number of ways can you climb if u use either 1, 2 or 3 at a time?
When you find any difficult problem first step is to reduce it to