Greedyhard70 minData Engineer

Metrics Greedy Load Rebalancer

Data Engineer signal: greedy proof + sorting in a metric dependency graph context. This is a ProdMatch-owned data engineer drill, framed as a May 2026 CRED Analytics Platform simulation, not a copied platform question.

Company context

CRED · Analytics Platform

Freshness

May 2026

Product surface

metric dependency graph

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

Question

Rebalance metrics across shards for metric dependency graph. 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

stream windows
watermarks
lineage DAGs
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

Watermark Greedy Load Rebalancermedium Lineage Greedy Load Rebalancermedium Dedupe Greedy Load Rebalancerhard