Challenge: Weighted Scheduling Problem
Explore how to apply dynamic programming techniques to the Weighted Scheduling Problem. Learn to find an optimal schedule that maximizes the utility of an auditorium by selecting non-overlapping classes based on start and end times and their utility values. Develop problem-solving skills by manually working through examples and building a coded solution for this advanced challenge.
We'll cover the following...
We'll cover the following...
Problem statement
You have one auditorium, and only one class can take place at the time; however, you have different options for these classes. Each class, c, is characterized by its start time, end time, and total utility we can get out of this class. The utility here could be the number of ...