Follow the Money, Mind the Loop
Hard About 30 min Katabench Pro
Walk a cyclic transfer graph with WITH RECURSIVE and a visited-path guard; without one the walk never terminates.
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
- Recursive queries
- Walk hierarchies and graphs with WITH RECURSIVE, guarding against cycles.
Do these first
Related katas
- Explode the Bill of Materials Hard Pro Recursively multiply quantities along every BOM path and aggregate shared leaves without erasing duplicate requirements.
- The Spill Changes the Next Step Hard Pro Replay ordered signed flows with a capacity clamp at every step, carrying discarded overflow and unmet withdrawals into a final audit.
- Let PostgreSQL Mark the Cycle Hard Pro Traverse dependency paths with declarative SEARCH ordering and CYCLE marking instead of a depth cap or hand-built visited guard.
- Customer Order Totals Medium Free Sum each customer's orders with a single SQL query instead of an N+1 loop.