Greedymedium45 minDevOps / SRE Engineer

OnCall Greedy Load Rebalancer

DevOps / SRE Engineer signal: greedy proof + sorting in a on-call routing context. This is a ProdMatch-owned devops sre drill, framed as a March 2026 Groww Incident Response simulation, not a copied platform question.

Company context

Groww · Incident Response

Freshness

March 2026

Product surface

on-call routing

ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.

Question

Rebalance pages across shards for on-call routing. Each move has a cost equal to distance between shards. Compute minimum cost to make shard loads differ by at most one.

Input

Array of shard loads.

Output

Minimum movement cost.

Constraints

1 <= shards <= 200000
Total load <= 1e12

Concepts

blast-radius graphs
alert dedupe
rolling windows
greedy proof
sorting
load balancing

loads [0,3,0] -> move one unit left and one right, cost=2

Approach

Try framing your own approach first. The 30 seconds you think before peeking is where learning happens.

Clean Solution

Reveal the approach first.

How well did you understand?

Your rating tunes when this problem shows up again.

Common Mistakes

A greedy idea without a proof may fail hidden cases.
Do not mutate sorted keys in a way that breaks ordering.

Next Similar Problems

Incident Greedy Load Rebalancermedium Deploy Greedy Load Rebalancermedium Capacity Greedy Load Rebalancerhard