[FEATURE REQUEST] <title>Coin Tower Problem Using Dynamic Programming

[DineshK3012]

What would you like to Propose?

I want to add Coin Tower Problem to the Dynamic Programming folder

Issue details

Coin Tower Problem:

A and B are playing a new game today. They form a tower of N coins and make a move in alternate turns. B plays first. In one step, the player can remove either 1, X, or Y coins from the tower. The person to make the last move wins the game. Can you find out who wins the game?

Additional Information

No response

[DineshK3012]

Added coin tower problem code : #4547

[SarthakChaudhary46]

@vil02 You mentioned having a few ideas for contribution. Please do let me know, brother—I'm all ears. Also, Do you no longer require a solution for this issue, or was my attempt not satisfactory?

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!

[github-actions]

Please reopen this issue once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!