# Maximum Tastiness Of Candy Basket: Explained
Maximum Tastiness Of Candy Basket shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Pick k distinct candies to maximize the minimum pairwise price gap. Binary-search the gap T and greedily check that k sorted prices can be chosen at least T apart.
## 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 + n log W).
## Common mistake
Checking T with an arbitrary subset instead of the greedy left-to-right pick.
## 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 www.linkjob.ai.