Algorithm · Atlassian · Medium
Requirements The input is a list of booking entries, represented in the following standard form: Produce a schedule that maps each booking to one particular court. No court may host two bookings simultaneously. Assuming courts are not limited, minimize the total number of courts used. Consider these separate extensions: In one extension, once a booking ends, its court must remain unavailable for a fixed maintenance duration X before another booking may use it. In another…
Checking your access…