The Order Digest Tree
Hard About 35 min Katabench Pro
Shape a bounded customer, order, and line-item tree inside one translated EF Core query instead of loading the full graph.
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 Project Only the Names, 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
- Projections
- Select only the columns and shapes the caller needs instead of materializing whole entities.
- Top N per group
- Pick the latest or best rows per group, with explicit tie handling and deduplication.
Related katas
- Three Leaders in Every Market Hard Pro Take a bounded set of revenue leaders inside every country after a four-table aggregate.
- One Query, Sixty Thousand Rows Hard Pro Chained collection Includes multiply into a cartesian row explosion. Ask the database for the answer instead of the graph.
- Project Only the Names Easy Free Select just the customer names server-side instead of materializing whole entities to read one column.
- Latest Row per Group with DISTINCT ON Hard Pro Use Postgres DISTINCT ON to keep one row per group: the most recent order per customer.