# Maximum Profit Of Operating A Centennial Wheel: Explained
Maximum Profit Of Operating A Centennial Wheel shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The wheel boards up to 4 waiting customers per turn and you pay runningCost each rotation. Simulate arrivals plus the leftover queue, board min(4, waiting), track profit, and return the earliest rotation that hits the maximum positive profit (or -1).
## 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 + total/4).
## Common mistake
Boarding more than 4, or returning a later rotation when several share the same max profit.
## 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 here.