Notizen
Interval Scheduling
Inhalt der Notizen (3)
Seite 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/
Seite 2
Weighted Interval Scheduling
http://www.geeksforgeeks.org/weighted-job-scheduling-log-n-time/
O(nLogn) time. good one.
Seite 3
Minimum meeting rooms given start and end time of meeting rooms.
http://www.geeksforgeeks.org/minimum-number-platforms-required-railwaybus-station/
Informationen
- Beschreibung
- Interview Computer Studies Notiz am Interval Scheduling, erstellt von Chaitanya Sarda am 13/08/2017.
- Erstellt von
- Chaitanya Sarda
- Aufrufe
- 1
- Bewertung