Job Execution

Problem Overview

• Determine the minimum number of operations to finish all parallel jobs when each operation runs one major job for x seconds and all others for y seconds (y < x).
• Input: executionTime array, integers x and y; Output: the smallest number of operations to complete every job.
• Context: processor scheduling problem where jobs leave once their required time is met.
• Source: Adobe interviews; a coding interview problem often used as an interview question.