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].
Formally, person i can see person j if:
i<j and min(heights[i],heights[j])>ma ...