← Questions
Weighted job scheduling
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Each job has a start time, an end time and a profit. Choose jobs that do not overlap to make the most profit. Sort jobs by end time; for each job, binary search for the last job that ends before it starts and take the better of skipping it or adding it to that best result.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding

