# Fruit Into Baskets: Explained
Fruit Into Baskets shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Longest subarray with at most two distinct values: a sliding window whose count map has size <= 2.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Using a set of the whole array instead of a window, which cannot drop the leftmost fruit type.
## 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.