why is this problem in this section? and which method should we use to solve it
Activity selection problem
hello @Shortcuttohell
this problem is based on greedy approach,
first u need to sort the array on the basis of ending time
and then u need to calculate maximum non overlapping activities by iterating from starting index
u should sort on the basis of ending time (i.e second value of pair)
here u should compare starting time of jth activity with ending time of last included activity
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.