Whose Basket Is a Proper Subset?
Hard About 35 min Katabench Pro
Compare dynamic distinct purchase sets with nested existence checks and return every proper customer-set containment relation.
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
- Relational division
- Find rows related to every member of a set, not just some of them.
- Semi-joins and anti-joins
- Ask existence questions with EXISTS, NOT EXISTS or Any instead of loading or counting rows.
Do these first
Related katas
- Customers Without Orders Medium Free Find customers who never ordered with one anti-join instead of an N+1 loop.
- Existence Without Loading Easy Free Answer a yes/no existence question by asking the database, not by loading the rows to count them.
- Acquired, Then Returned Hard Pro Build a first-purchase cohort and preserve countries whose acquired customers never returned.
- 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.