Platform Engineer signal: greedy proof + sorting in a build graph scheduler context. This is a ProdMatch-owned platform engineer drill, framed as a April 2026 BrowserStack Developer Platform simulation, not a copied platform question.
Company context
BrowserStack · Developer Platform
Freshness
April 2026
Product surface
build graph scheduler
ProdMatch interview simulation based on product-team patterns; not a claim of a real company question.
Rebalance targets across shards for build graph scheduler. 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.