Activity Selection Problem

#1

Please describe the approach How to proceed for this problem?

#2

@ashwani225 You need to sort the activities in ascending order of their ending times and the choose greedily in one traversal, i.e., pick the activity that you can on your way to the end.