Maximize longest time period without presentation
Filed under Uber
The question
Given a meeting of total time t with n non-overlapping presentations having start and end times, and an integer k representing the maximum number of presentations you can reschedule while keeping their original order and duration intact, find the maximum possible time period during the meeting where no presentation is scheduled.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.