Nearest Depots Without Sorting the World
Hard About 25 min Katabench Pro
Use PostgreSQL point distance ordering and a GiST KNN scan to find the nearest active depots.
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 Existence Without Loading, 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
- GIN and GiST indexes
- Index containment, overlap, nearest-neighbor and text search operators.
- Server-side filtering
- Filter, count and sort in the database instead of in application memory.
- Partial indexes
- Index only the rows a hot query reads, and match the predicate that enables it.
Related katas
- Existence Without Loading Easy Free Answer a yes/no existence question by asking the database, not by loading the rows to count them.
- Filter Before You Fetch Easy Free Filter measurements on the database, not after loading the whole table.
- Fetch the Request, Not Just the Set Hard Pro Turn requested composite keys into a parameterized VALUES table that preserves tenant scope, duplicates, and order.
- The Most Specific Firewall Rule Wins Hard Pro Match IPv4 and IPv6 addresses with native network containment, then choose the longest enabled prefix.