You are given an integer array capacity, where capacity[i] represents the capacity of the $i^{ ext{th}}$ box, and an integer itemSize representing the size of an item.

A box can store the item if its capacity is greater than or equal to itemSize.

Return the index of the box with the minimum capacity that can store the item. If multiple boxes share this same minimum capacity, return the smallest index among them. If no box can store the item, return $-1$.

Constraints:

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

• $1 \leq$ capacity[i] $\leq 100$

• $1 \leq$ itemSize $\leq 100$

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.