Given an integer array nums consisting only of the integers $0$, $1$, and $2$, find the minimum absolute difference between the indices i and j such that nums[i] is equal to $1$ and nums[j] is equal to $2$.

Return the minimum value of $|i - j|$ among all such pairs. If the array does not contain both $1$ and $2$, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $0 \leq$ nums[i] $\leq 2$

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.