Solution: Number of Visible People in a Queue
Explore how to determine the number of visible people to the right of each person in a queue using a monotonic decreasing stack. This lesson guides you through an O(n) time complexity algorithm that counts visible individuals by processing heights in reverse order, helping you understand stack-based problem-solving in coding interviews.
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 ...