Activity Selection
Easy Accuracy: 47.53% Submissions: 28752 Points: 2

Given N activities with their start and finish day given in array start[ ] and end[ ]. Select the maximum number of activities that can be performed by a single person, assuming that a person can only work on a single activity at a given day.
Note : Duration of the activity includes both starting and ending day.

Example 1:

N = 2
start[] = {2, 1}
end[] = {2, 2}
A person can perform only one of the
given activities.

Example 2:

N = 4
start[] = {1, 3, 2, 5}
end[] = {2, 4, 3, 6}
A person can perform activities 1, 2
and 4.

Your Task :
You don't need to read input or print anything. Your task is to complete the function activityselection() which takes array start[ ], array end[ ] and integer N as input parameters and returns the maximum number of activities that can be done.

Expected Time Complexity : O(N * Log(N))
Expected Auxilliary Space : O(N)

1 ≤ N ≤ 2*105
1 ≤ start[i] ≤ end[i] ≤ 109

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.

to report an issue on this page.


We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?


All Submissions

My Submissions:

Login to access your submissions.

Activity Selection

Output Window