Number of Visible People in a Queue
Understand how to apply stack data structures to solve the problem of counting visible people in a queue based on their heights. This lesson guides you through implementing efficient algorithms that identify visibility conditions and return accurate counts for each person, reinforcing your skills in coding interview patterns and stack usage.
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 ...