Top Earner, No Windows Allowed
Medium About 25 min Katabench Pro
Find every department's top earners, ties included, with a correlated NOT EXISTS or a department-aware join, never a window function.
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 Customers Without Orders, 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
- Semi-joins and anti-joins
- Ask existence questions with EXISTS, NOT EXISTS or Any instead of loading or counting rows.
- Correlated subqueries and LATERAL
- Compute per-row results with correlated subqueries or LATERAL joins without one query per row.
- Top N per group
- Pick the latest or best rows per group, with explicit tie handling and deduplication.
Related katas
- Every Order at the Latest Instant Medium Pro Find each customer's latest order timestamp without throwing away other orders tied at that same instant.
- The Second Purchase Is Per Customer Medium Pro Use a correlated bounded subquery to select each customer's second chronological order.
- Three Leaders in Every Market Hard Pro Take a bounded set of revenue leaders inside every country after a four-table aggregate.
- The Touch Must Precede This Conversion Hard Pro Attribute each conversion to its last eligible campaign touch using a conversion-relative window and deterministic tie break.