Leetcode Problem 406. Queue Reconstruction by Height

406. Queue Reconstruction by Height

Leetcode Solutions

Sort the people array in descending order of height h. For people of the same height, sort them in ascending order of k values.
Initialize an empty list queue.
Iterate over the sorted people array.
For each person (h, k) in people, insert them into the queue at the index k. This is possible because the people already in the queue are as tall or taller than the current person.
Return the queue after all people have been placed.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen