Agoda OA | Dec 2024 | Set - 3 | Desi QnA | Kumar K

Question

The question was this word for word:

https://studyx.ai/homework/108422591-there-are-n-towers-placed-sequentially-in-the-city-of-hackerland-tower-x-is-visible-from

Eg: heights = [1,2,3,4,5]

output = [4,4,3,2,1]

How can this be solved in under O(n^2)?

It resembles https://leetcode.com/problems/number-of-visible-people-in-a-queue/description/ but not exactly.