Optimal Game Strategy, is a Dynamic Programming related problem and in this post we will see how we can solve this challenge in C++

Given coins with values v1,v2 ,v3......vn .Now this is a game where we can select either a value from front or from back of the coins and we remove it and get to keep it.There are even number of coins .Suppose we start first ,then what is the max value we can get by playing this game

Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @susantabiswas