Practice Queue Reconstruction by Height

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#406

LeetCode Problem

Queue Reconstruction by Height

Array Binary Indexed Tree Segment Tree Sorting

Problem Statement

You are given an array of people, 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 people. 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).

Source: Queue Reconstruction by Height on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

people = [[7,0],[4,4],[7,1],[5,0],[6,1],[5,2]]

Output

[[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]]

# Example 2

Input

people = [[6,0],[5,0],[4,0],[3,2],[2,2],[1,4]]

Output

[[4,0],[5,0],[2,2],[3,2],[1,4],[6,0]]

Constraints

1 <= people.length <= 2000

0 <= hi <= 10^6

0 <= ki < people.length

It is guaranteed that the queue can be reconstructed.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free