Job Scheduling

Problem Overview

• Find the maximum jobs on the k‑th (most efficient) processor with a balanced schedule.
• Balanced: neighboring processors differ by ≤1 job; each processor has at least one job.
• Input: n processors, m jobs, k index (1‑based). Output: integer maximum for processor k.
• Domain: computing load balancing/job scheduling; coding interview problem.
• From Sofi interviews; classic interview question with n≤1e5, m≤1e9.