given two arrays that one array consists of the arrival time of trains and the other one consists of the departure time of trains. find out the minimum number of platforms so that none of them should crash.

Question

Accepted Answer

The minimum number of platforms needed to avoid train crashes based on arrival and departure times.

Sort the arrival and departure arrays in ascending order.
Initialize a variable to keep track of the maximum number of platforms needed.
Iterate through the arrival and departure arrays simultaneously.
If the current arrival time is less than or equal to the current departure time, increment the platform count.
If the current arrival time is greater than the current departure time, decrement the platform count.
Update the maximum number of platforms needed if the current count exceeds the previous maximum.
Return the maximum number of platforms needed.

Accepted Answer

based on the knap-sack problem.

given two arrays that one array consists of the arrival time of trains and the other one consists of the departure time of trains. find out the minimum number of platforms so that none of them should crash.

Top Carwale Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in Carwale Software Developer