Submission Title
Dynamic Programming: Determine the maximum number of coins that can be won
Submission Type
Algorithm
Submission Description
Consider a row of n coins of values v1 . . . vn, where n is even. We play a game against an opponent by alternating turns. In each turn, a player selects either the first or last coin from the row, removes it from the row permanently, and receives the value of the coin. Determine the maximum possible amount of money we can definitely win if we move first.
Folder Related To
Algorithm => Dynamic Programming => Maximum Achievable coins
Contributors
馃憢 @shaunak56
Thanks for opening your first issue here! Be sure to follow the issue template!
I want to work on this issue. @shaunak56
Can I work on this as well? I can do either python, js or the php one
I want to work on this issue in python or c++
Great :clap:
@rachleona , go ahead with php
@arnav-roy , go ahead with c++
I want to work on this issue in java馃槉
i have done that problem in java so i make pull request馃槉
I too would love to try this problem in c++, as it seems very interesting. Please assign it to me too.
Hi 鉁岋笍,
I want to work on this issuein Python馃悕
Hey i can work on this in C# or C. Please assign me for it. Thank you.
i just did for C imma do for C# too
Hi @subhadeep1912 :wave:
I'm closing this issue but you can still go ahead and create a PR.
thanks eveyone :v: