Number of Visible People in a Queue
Explore how to solve the number of visible people in a queue problem by using stacks. Understand how to evaluate visibility based on height comparisons and practice implementing an efficient solution to determine how many people each individual can see to their right.
We'll cover the following...
We'll cover the following...
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].
Formally, person i can see person j if:
and ...