SDE - 2

Given a DAG(direct acyclic graph), return the Topological Sorting of a given graph.

You are given the schedule of 'N' meetings with their start time 'Start[i]' and end time 'End[i]'.

You have only 1 meeting room. So, you need to return the maximum number of meetings you can organize.

Note:

The start time of one chosen meeting can’t be equal to the end time of the other chosen meeting.

For example:

'N' = 3, Start = [1, 3, 6], End = [4, 8, 7].

You can organize a maximum of 2 meetings. Meeting number 1 from 1 to 4, Meeting number 3 from 6 to 7.

You are an ATC. Given m runways and n flights, how can you make these flights land in order to avoid collision and in first come first serve manner. Flight validation if yes -> response would be runway no. if no then it should be placed in wating queue After 2 mins runway get cleared.