The interview was good, and they asked Data Structures and Algorithms (DSA) questions.

They asked me a queue-based question regarding platform availability when multiple trains arrive on the same platform. I solved it using stacks but was unable to clear the round.

Given the arrival and departure times of all trains that reach a railway station, find the minimum number of platforms required for the railway station so that no train is kept waiting.

Consider that all trains arrive on the same day and leave on the same day.

Arrival and departure times can never be the same for a train, but we can have the arrival time of one train equal to the departure time of another.

At any given instance of time, the same platform cannot be used for both the departure of a train and the arrival of another train. In such cases, we need different platforms.