Solution: Number of Visible People in a Queue
Understand how to use a monotonic stack to solve the problem of counting visible people to the right in a queue by analyzing heights. Learn the step-by-step algorithm that processes the queue in reverse, efficiently determining visibility with a stack for optimal time and space 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 ...