# Maximum Number Of Coins You Can Get: Study Guide

Maximum Number Of Coins You Can Get shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

3n piles; you and Alice and Bob pick in turns of 3 sorted piles: Alice takes the largest remaining, you the next, Bob the smallest. Sort and repeatedly take the second-largest of each leftover triple (equivalently: take every other pile from the end, n times, skipping the n smallest).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n).

## Common mistake

Always taking the current maximum (that pile goes to Alice) or including the n smallest piles.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at official website.