Solution: Number of Visible People in a Queue
Explore how to implement a stack-based algorithm to calculate how many people each person can see to their right in a queue. Learn to apply the monotonic decreasing stack pattern for efficient visibility counting with linear time complexity.
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].
Forma ...