Continue After This Order
Medium About 20 min Katabench Pro
Turn a timestamp and id cursor into a fully ordered seek predicate, so a deep page reads only the rows it returns.
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
- Keyset pagination
- Seek from a cursor on an ordered key instead of skipping rows with OFFSET.
- Deterministic ordering
- Make ORDER BY total with tie-breakers so limits, pages and aggregates stay stable.
Related katas
- Two Consecutive Readings Confirm It Medium Pro Confirm alarms from adjacent high samples within a maximum gap, without skipping intervening low readings.
- Rank a Release Before It Ships Medium Pro Use a hypothetical-set RANK aggregate to place an unpersisted release in every channel leaderboard.
- Ten Rows Is Not the Top Ten Medium Pro The widget owes ten best sellers plus everyone level with the tenth, and LIMIT counts rows, not sales figures.
- The Running Total That Jumped Medium Pro A running balance over tied timestamps prints the same end-of-batch total on every line of the batch, because the default window frame folds rows that tie into one.