Schedule Batch Difference

Problem Overview

• Task: Partition n servers into k batches per numServers; for each batch, take (max capacity - min capacity); return the sum.
• Input: n, capacities[n], k, numServers[k] where numServers[i] is servers in batch i. Output: single integer total difference.
• Constraints: sum(numServers) = n, n ≤ 1e6, k ≤ n.
• Context: Server capacity planning and scheduling.
• Source: Salesforce coding interview problem; common interview question.