One Query per Row
Hard About 30 min Katabench Pro
Collapse correlated SELECT-list subqueries into one grouped join: the N+1 that hides inside a single statement.
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
- Correlated subqueries and LATERAL
- Compute per-row results with correlated subqueries or LATERAL joins without one query per row.
- N+1 queries
- Replace a query per row, or per key, with one set-based round trip.
Related katas
- Customer Order Totals Medium Free Sum each customer's orders with a single SQL query instead of an N+1 loop.
- Customers Without Orders Medium Free Find customers who never ordered with one anti-join instead of an N+1 loop.
- Top Spending Customers Medium Free Return the highest-spending customers with one ranked query, not an N+1.
- Three Leaders in Every Market Hard Pro Take a bounded set of revenue leaders inside every country after a four-table aggregate.