Who Bought This Show
Medium About 20 min Katabench Pro
Find a show's ticket buyers in one statement instead of a query per booking.
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
- N+1 queries
- Replace a query per row, or per key, with one set-based round trip.
- Semi-joins and anti-joins
- Ask existence questions with EXISTS, NOT EXISTS or Any instead of loading or counting rows.
Related katas
- Customers Without Orders Medium Free Find customers who never ordered with one anti-join instead of an N+1 loop.
- Count Active Devices Medium Pro Collapse a per-device existence probe into one server-side count under a memory cap.
- Customer Order Totals Medium Free Sum each customer's orders with a single SQL query instead of an N+1 loop.
- Top Spending Customers Medium Free Return the highest-spending customers with one ranked query, not an N+1.