The Cutoff Includes Every Tie
Hard About 30 min Katabench Pro
Select the top N distinct product-revenue scores in a subquery so every product tied at the cutoff survives.
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
- Top N per group
- Pick the latest or best rows per group, with explicit tie handling and deduplication.
- Composable queries
- Keep IQueryable deferred so optional filters and subqueries compose into one statement.
- Deterministic ordering
- Make ORDER BY total with tie-breakers so limits, pages and aggregates stay stable.
Related katas
- Three Leaders in Every Market Hard Pro Take a bounded set of revenue leaders inside every country after a four-table aggregate.
- Nobody Beats Them on Both Axes Hard Pro Find the customer skyline by anti-joining aggregated spend and order-count scores against every proper dominator.
- Balance at Every Order Hard Pro Project an inclusive running order balance with a deterministic correlated nested query.
- The Order Digest Tree Hard Pro Shape a bounded customer, order, and line-item tree inside one translated EF Core query instead of loading the full graph.