Zoho | On-Campus OA 2026 | Visible Towers | Server Clusters | HackerRank Coding Assessment | Complete Solutions & Tips | Data Tracking Arrays & Tree Traversal | Mar 15th Campus Assessment

Question 1: Visible Towers Problem Statement: In Hackerland, there are n towers arranged in a sequence, each with a specific height. For each tower, determine how many other towers it can "see" both to its left and right. A tower i can see another tower j (where j != i) if all towers between i and j are shorter than tower j. Example: Given towers with heights [5, 2, 10, 1]: Tower 1 (height 5) can see towers 2 and ...