GoConqr has a new look! Let us know what you think.

Notes

Interval Scheduling

Chaitanya Sarda Computer Studies Interview English 3 pages

Content of the notes (3)

Page 1

Non-Weighted Interval Scheduling

Very Simple : Greedy solution. Sort the intervals by end time and then just find the simple answer.

http://www.geeksforgeeks.org/greedy-algorithms-set-1-activity-selection-problem/

Page 2

Weighted Interval Scheduling

http://www.geeksforgeeks.org/weighted-job-scheduling-log-n-time/

O(nLogn) time. good one.

Page 3

Minimum meeting rooms given start and end time of meeting rooms.

http://www.geeksforgeeks.org/minimum-number-platforms-required-railwaybus-station/

Information

Description
Interview Computer Studies Note on Interval Scheduling, created by Chaitanya Sarda on 13/08/2017.
Created by
Chaitanya Sarda
Views
1
Rating

Feedback

What is it about?

What do you think of the new look?

How do you like it?