# Minimum Consecutive Cards To Pick Up: Explained

Minimum Consecutive Cards To Pick Up shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Return the shortest subarray that contains at least one duplicate value, or -1. Track the last index of each value and minimize i-last[x]+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).

## Common mistake

Returning the count of matching cards instead of the window length.

## 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 Linkjob.