Search⌘ K
AI Features

Solution: Number of Visible People in a Queue

Explore how to calculate the number of visible people to the right of each person in a queue by using a monotonic decreasing stack. Understand the approach that iterates the queue from right to left, efficiently counting visible individuals by popping shorter heights and including the first taller or equal height to block the view. This lesson teaches an O(n) time and space solution applicable in coding interviews involving stack data structures.

Statement

You are given an array heights representing n people standing in a queue, numbered from 0 to n - 1 from left to right. Each element heights[i] denotes the height of the person at position i. All heights are distinct.

A person at position i can see a person at position j (i < j) to their right if every person between them is shorter than both heights[i] and heights[j].

Forma ...