You are given an integer array groups, where each element represents the size of a group, and an integer array elements.

For each group groups[i], assign the smallest index j such that elements[j] divides groups[i] with a remainder of $0$. If no such element exists, assign $-1$ to that group.

Return an integer array assigned of the same length as groups, where assigned[i] represents the index of the element assigned to groups[i].

Constraints:

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

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

• $1 \leq$ groups[i] $\leq 10^5$

• $1 \leq$ elements[i] $\leq 10^5$

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.