You are given two positive integers x and y, denoting the number of coins with values 75 and 10 respectively.
Alice and Bob are playing a game. Each turn, starting with Alice, the player must pick up coins with a total value 115. If the player is unable to do so, they lose the game.
Return the name of the player who wins the game if both players play optimally.
Example 1:
Input: x = 2, y = 7
Output: "Alice"
Explanation:
The game ends in a single turn:
Example 2:
Input: x = 4, y = 11
Output: "Bob"
Explanation:
The game ends in 2 turns:
Constraints:
1 <= x, y <= 100Solutions for this problem are being prepared.
Try solving it yourselfCoin Change - Dynamic Programming Bottom Up - Leetcode 322 • NeetCode • 574,201 views views
Watch 9 more video solutions →Practice Find the Winning Player in Coin Game with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor