The Busiest Instant
Hard About 35 min Katabench Pro
Find peak concurrency with a signed boundary sweep that respects half-open intervals and simultaneous handoffs.
The full brief is part of Katabench Pro
Pro opens this kata's brief, its starter code and its grader. To see how the track works first, try Customer Order Totals, which is free.
How it is graded
Your LINQ or SQL runs against real PostgreSQL. You see the SQL your code generates on the sample tests and can inspect its execution plan, so you learn when the database did the wrong work.
What it practices
- Window functions
- LAG, LEAD, running sums and shares computed over partitions without collapsing rows.
- Intervals and sweep lines
- Sort or sweep interval boundaries, including difference arrays for range updates.
Related katas
- Match Two Money Streams Hard Pro Allocate ordered payments across ordered invoices by intersecting their cumulative monetary spans.
- Choose the Auction Clearing Price Hard Pro Build cumulative demand and supply at every active limit price, then choose a clearing price with deterministic volume, imbalance, and reference-price priorities.
- Every Cent Must Land Somewhere Hard Pro Use largest-remainder apportionment so rounded integer allocations conserve the exact budget.
- Month-over-Month Growth with LAG Hard Pro Compare each row to the one before it with LAG() over an ordered window of monthly totals.