N meetings in one room

• Status: Completed

Solved	Solution	Time
	Greedy	0.55 s

Solution or Solution discussion

Gready Solution

The solution to solve this problem use the greedy approach and the algorithm sorts inputs arrays by ending time and check if the next meeting has a good start time (start[i] > end[i - 1]), if yes the meeting in position i can be choose.

The complexity time of this algorithm is O(N log N) and the space complexity is O(1) no additional space is needed.