Greedy Problem

Please help me how to solve it - Given a collection of jobs, each with a start and end time. Two jobs are compatible if they don’t overlap. Find maximum subset of mutually compatible jobs.

Please give the link to the question or copy paste it here, I think people will be able to help better If they read the question and know the constraints, sample cases etc.

This question belongs to activity selection problem of greedy approach. You can easily search it on net.But for your convenience you can go for this link:

1 Like