Count Visible Towers

nvidia

Problem: Count Visible Towers

You are given a row of n towers. The height of the i-th tower is height[i].

For two different towers i and j:

  • If j > i, tower i looks to the right t...

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Standard Input
Execution Result: