You are given an integer array cards representing a sequence of cards.

Find the minimum number of consecutive cards you must pick up such that the selected sequence contains at least one pair of matching cards with the same value.

Return the minimum length of such a consecutive subarray. If it is impossible to find any matching pair, return $-1$.

Constraints:

• $1 \leq$ cards.length $\leq 10^5$

• $0 \leq$ cards[i] $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.