Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1944. Number of Visible People in a Queue
For each person in an array of distinct heights, compute how many people to their right are "visible" (j is visible from i if every person between i and j is shorter than both). The problem reduces to a right-to-left scan using a monotonic-decreasing stack to efficiently count consecutive shorter people until a taller person blocks visibility (n up to 1e5).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.