Solution: Number of Visible People in a Queue
Understand how to use a monotonic decreasing stack to solve the problem of counting visible people to the right in a queue. This lesson explains the algorithm, implements it step-by-step, and covers the reasoning behind time and space complexity, helping you apply stack patterns effectively.
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 ...