Get Max Programs

Problem Overview

• Determine the maximum number of consecutive programs from the end that can be executed.
• Input: time array, number of time slots m, and slot length k; Output: an integer count; Constraints: 1≤n,m≤2e5, 1≤k≤1e9, 1≤time[i]≤k.
• Programs run in order, cannot be interrupted, and must fit in each slot; if not, they move to the next slot.
• Context: scheduling within an Amazon software management tool using non-overlapping time slots.
• From Amazon interviews; a coding interview problem and interview question.