Ganesh Chaturthi Special Discount is Live!

Get Festive Discount
  • Company: Metropolis
  • Location: Bangalore
  • Experience: 11
  • Interview Date: 2026-07-20

Round 1 : Behavioral/Managerial/HR

  • project discussion and key contributions, technologies challenges in brief

Round 2 : DSA Round

  • you manage a parking lot. With N spots and want to go green by converting excess spots to bicycle parking or EV charging stations. You are given an integer N representing the current number of parking spots. A 2D integer array visits where visits of I is equal to entry of I and exit of comma exit of I represents a car entering at in time entry exit. Return the number of excess parking spots that were never needed. Input: N = 3, visits = [[7, 10], [2, 4]] Events: (2, +1), (4, -1), (7, +1), (10, -1) Trace: Time 2: currentOccupancy becomes 1, maxOccupancy = 1. Time 4: currentOccupancy becomes 0, maxOccupancy = 1. Time 7: currentOccupancy becomes 1, maxOccupancy = 1. Time 10: currentOccupancy becomes 0, maxOccupancy = 1. Result: 3 - 1 = 2 excess spots.
  • Determine busiest spot int n list of list of integer visits and the answer should be my spot with the lowest number. Like return the spot number that parked the most cars busiest spot. If multiple spots are tied, return the spot with the lowest number. Test Case Let's test with N = 3 and the following visits (represented as [entry, exit]): [[1, 4], [2, 5], [3, 6], [7, 10]] Logic Trace: Time 1: Car 1 arrives. Spot 1 is free. Car 1 takes Spot 1 (Exit: 4). spotUsage = {1: 1, 2: 0, 3: 0}. Time 2: Car 2 arrives. Spot 2 is free. Car 2 takes Spot 2 (Exit: 5). spotUsage = {1: 1, 2: 1, 3: 0}. Time 3: Car 3 arrives. Spot 3 is free. Car 3 takes Spot 3 (Exit: 6). spotUsage = {1: 1, 2: 1, 3: 1}. Time 4: Car 1 leaves (Spot 1 becomes free). Time 5: Car 2 leaves (Spot 2 becomes free). Time 6: Car 3 leaves (Spot 3 becomes free). Time 7: Car 4 arrives. Spot 1 is free (it was the lowest number). Car 4 takes Spot 1. spotUsage = {1: 2, 2: 1, 3: 1}. Result: Spot 1 is the busiest.

Round 3 : HLD

  • Design a simplified version of metropolis parking system. You have a distributed sensor systems that are sending you entry, exit and health information for you network of locations. You are responsible for building a system that can handle customer communications and operational management of the platform and sensor network. You have full control of the sensors so can decide how they are communicating with the system but i want you to concentrate on the backend system but the sensor system.

Please take a moment to share your interview experience. Every experience helps thousands of aspirants prepare better, and your contribution plays a vital role in helping our community grow. ❤️

WhatsApp Icon