JobsJob TrackerJob alerts

Cashfree Payments ยท 13 questions

All 13Coding 11System Design 1Low-Level Design 1
  • Tic-Tac-Toe Game LogicLow-Level Design
  • Design a Notification ServiceSystem Design
  • Prefix Sum Coding ProblemCoding
  • Count Decreasing TripletsCoding
  • Visible Towers from Each TowerCoding
  • Maximize Minimum Element After K DecrementsCoding
  • Reverse an IntegerCoding
  • Search in Rotated Sorted ArrayCoding
  • Find Itinerary from TicketsCoding
  • Reduce string by removing K consecutive identical charactersCoding
  • Minimum operations to segregate zeros at the endCoding
  • Kth largest element in a streamCoding
  • Longest substring without repeating charactersCoding
โ† Cashfree Payments questions
  1. Interview questions
  2. Cashfree Payments
  3. Visible Towers from Each Tower
Coding

Visible Towers from Each Tower

Filed under Cashfree Payments

The question

Given n towers of varying heights, find the count of towers visible from each tower. A tower x is visible from tower y if all towers situated strictly between them have heights strictly less than x.

No write-up yet. Related questions below have one.

Related Cashfree Payments questions

  • Prefix Sum Coding Problem
  • Count Decreasing Triplets
  • Maximize Minimum Element After K Decrements
  • Reverse an Integer
  • Find Itinerary from Tickets
โ† Count Decreasing TripletsMaximize Minimum Element After K Decrements โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.