You are given an array people, representing attributes of individuals standing in a queue. Each element people[i] $=$ [h_i, k_i] describes a person of height h_i who has exactly k_i other people in front of them with a height greater than or equal to h_i.

Reconstruct and return the queue such that every person is placed in an order satisfying their height and positional requirements.

Constraints:

• $1 \leq$ people.length $\leq 2000$

• $0 \leq$ h_i $\leq 10^6$

• $0 \leq$ k_i $<$ people.length

• It is guaranteed that the queue can be reconstructed.

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.