Long Break

Weride coding interview question: Given arrays of start and finish times for talks in a single room starting at time 0, and an integer k for how many talks you may reschedule while preserving their order, determine the maximum length of the longest networking break when no talk is running. This problem is an interview question asking for the integer maximum gap between presentations.