Dynamic Programming, Facebook Coding Interview, Google Coding Interview, Coding Interviews, Java.
nums[i] dp[i] otherwise 2 Player Game Given n coins two players A and B are playing a game with alternate turns. In each turn player can either choose first coin or last coin. Find maximum sum of coins player A can get. Input array coins[] containing n positive integers Dp state dp[i][j] represents