DevOps / SRE Engineer signal: greedy proof + sorting in a rolling deploy planner context. This is a ProdMatch-owned devops sre drill, framed as a March 2026 Arcesium Release Platform simulation, not a copied platform question.
Company context
Arcesium · Release Platform
Freshness
March 2026
Product surface
rolling deploy planner
ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.
Rebalance pods across shards for rolling deploy planner. Each move has a cost equal to distance between shards. Compute minimum cost to make shard loads differ by at most one.
Input
Output
Constraints
Concepts
loads [0,3,0] -> move one unit left and one right, cost=2
Try framing your own approach first. The 30 seconds you think before peeking is where learning happens.
Reveal the approach first.
Your rating tunes when this problem shows up again.