Given an array of positive integers queries and an integer m, consider a permutation P containing all integers from $1$ to m initialized in increasing order.

For each query queries[i]:

• Find the $0$ indexed position of queries[i] in the permutation P.

• Move queries[i] to the start of the permutation P.

Return an array containing the resulting positions for all processed queries.

Constraints:

• $1 \leq$ m $\leq 10^3$

• $1 \leq$ queries.length $\leq$ m

• $1 \leq$ queries[i] $\leq$ m

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.