Back to problems

Party Time Blocks

Algorithm · Scale AI · Medium

Requirements The input contains party intervals organized by neighborhood or block. For every neighborhood, determine the overall party-window boundaries by taking the earliest start and the latest end among its active intervals. Sort the intervals by start_time before performing the scan. Identify the time intervals during which no party is active. Timestamps may be supplied as strings. Normalize them by extracting their hour component with a helper such as get_hour; do not…

Checking your access…