widal001 / dsa-sandbox Goto Github PK

Summary

Given a set of x movies and y audiences and a mapping of movie to the audience(s) that will purchase tickets to it, design an algorithm that schedules the movies across n screens over k blocks of time in order to maximize the total box office sales over the course of a day.

Constraints

• If multiple movies that share a common audience are scheduled at the same time, the members of that audience will be split evenly between that set of movies.
• A movie can only be scheduled for one block per day.

Extensions

• Each movie has a different cost, and the theater has a maximum budget.
• Theater showrooms have a maximum size.
• Some audiences are only available to watch movies at certain times per day.

Definition of Done

• {Description of expected behavior once changes are made}
• {Description of expected behavior once changes are made}

Summary

Clear and concise summary of the work that needs to be completed

To Do

• {Description of change 1}
• {Description of change 2}

Definition of Done

• {Description of expected behavior once changes are made}
• {Description of expected behavior once changes are made}