406. Queue Reconstruction by Height

You are given an array of people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] represents the ith person of height hi with exactly ki other people in front who have a height greater than or equal to hi. Reconstruct and return the queue that is represented by the input array. The returned queue should be formatted as an array queue, where queue[j] = [hj, kj] is the attributes of the jth person in the queue (queue[0] is the person at the front of the queue).

🧠 Visual Learning Aid

💡 Approach

• → Sort people by height descending, and by k ascending
• → Insert each person at index k in result array
• → This ensures there are exactly k taller/equal people in front
• → Time: O(n²), Space: O(n)

🛠️ Hints & Pitfalls

Hints

• •Sort people by height descending, and by k ascending
• •Insert each person at index k in result array
• •This ensures there are exactly k taller/equal people in front

Common Pitfalls

• •Time: O(n²), Space: O(n)

🧪 Test Cases

Hidden tests on submit: 1