Greedymedium45 minFull Stack Developer

Realtime Greedy Load Rebalancer

Full Stack Developer signal: greedy proof + sorting in a realtime collaboration context. This is a ProdMatch-owned full stack engineer drill, framed as a March 2026 CleverTap Realtime Platform simulation, not a copied platform question.

Company context

CleverTap · Realtime Platform

Freshness

March 2026

Product surface

realtime collaboration

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

Question

Rebalance patches across shards for realtime collaboration. 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

workflow graphs
API pagination
cache invalidation
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

Onboarding Greedy Load Rebalancermedium Billing Greedy Load Rebalancermedium CRM Greedy Load Rebalancerhard