All prompts are owned by LeetCode. To view the prompt, click the title link above.
First completed : June 23, 2024
Last updated : June 23, 2024
Related Topics : Array, Math, Greedy, Sorting, Game Theory
Acceptance Rate : 84.545 %
class Solution:
def maxCoins(self, piles: List[int]) -> int:
piles = deque(sorted(piles))
output: int = 0
while piles :
piles.pop()
output += piles.pop()
piles.popleft()
return output