๐Ÿฅ‹ Katabench
Start free

The proving ground for .NET developers

Write better, faster C#

Five disciplines โ€” algorithms, SQL & EF Core, refactoring, architecture, secure coding โ€” graded the way production judges you. Real query plans pulled from the database, real allocations measured by the GC, real design rules, real attack payloads. Not just green checkmarks.

Solution.cs Trapping Rain Water ยท Hard
1 public int Trap(int[] height)
2 {
3 int l = 0, r = height.Length - 1, lMax = 0, rMax = 0, water = 0;
4 while (l < r)
5 {
6 if (height[l] < height[r])
7 water += (lMax = Math.Max(lMax, height[l])) - height[l++];
8 else
9 water += (rMax = Math.Max(rMax, height[r])) - height[r--];
10 }
11 return water;
12 }
Submission graded 3 / 3 tests passed
โœ“ Example 1
Passed 0.18 ms
โœ“ Example 2
Passed 0.21 ms
โœ“ Large input (n = 1,000,000) โ€” must be O(n) hidden
Passed 6.84 ms
time budget 3% of 250 ms
memory 0 B allocated

Every submission is measured like this โ€” per test, server-side, unspoofable.

graded puzzles, Easy to Hard
241
graded puzzles, Easy to Hard
disciplines, each with its own grading engine
5
disciplines, each with its own grading engine
mocks โ€” real database, real compiler, real GC
0
mocks โ€” real database, real compiler, real GC

Five disciplines, one bar: production quality

Far more than algorithm drills โ€” the whole craft that separates senior .NET engineers, each discipline with a grading engine built for it.

โšก
123 puzzles

Algorithms

Classic problems where correct is only halfway: hidden 200,000-element gates time out the O(nยฒ) pass, and allocation budgets โ€” measured by the GC, not estimated โ€” fail the copy-happy one.

๐Ÿ—„๏ธ
22 puzzles

Database & EF Core

LINQ against a real PostgreSQL database. The grader captures the execution plan the engine actually chose โ€” and grades it. Kill the N+1, earn the index scan.

๐Ÿงน
39 puzzles

Refactoring

Inherit working-but-awful code โ€” including the famous Gilded Rose โ€” and clean it up. Roslyn measures complexity, nesting, duplication, and method length while every test stays green.

๐Ÿ›๏ธ
25 puzzles

Architecture

Multi-file katas graded on design itself: dependency direction, layer isolation, extracted interfaces, sealed types. A wrong dependency fails the same way a failing test does.

๐Ÿ›ก๏ธ
32 puzzles

Secure Coding

Fix vulnerable-but-working code against real attack payloads โ€” path traversal, ReDoS, log forging, Zip Slip. Block the exploit without breaking the feature.

241

graded puzzles and counting

Every one with a gate that green checkmarks can't fake โ€” and new puzzles ship with every release.

Exhibit A

Your query plan is part of the grade

Submit LINQ and we run it on a real PostgreSQL instance seeded with tens of thousands of rows, capture the execution plan the engine actually chose, and grade the plan itself. Getting the right rows the wrong way is a visible, gradeable mistake here.

๐Ÿงญ Your query plan โ€” captured from the database, graded

The obvious filter

.Where(o => o.PlacedAt.Year == 2024 && o.PlacedAt.Month == 3)

Sort (by id)

โ”” Seq Scan on orders

~60,000 rows ยท โš  full table read

  • โœ— No full-table scan on orders
  • โœ— Uses the placed_at index
  • โœ“ One round-trip

โœ— 1 / 3 plan rules hold

The sargable rewrite

.Where(o => o.PlacedAt >= start && o.PlacedAt < end)

Sort (by id)

โ”” Index Scan using ix_orders_placed_at

~1,017 rows ยท โœ“

  • โœ“ No full-table scan on orders
  • โœ“ Uses the placed_at index
  • โœ“ One round-trip

โœ“ 3 / 3 plan rules hold

Same rows returned. Same green tests. Only one earns the index scan โ€” and the grade.

Straight from the engine

The plan comes from the database that just ran your query on realistic data โ€” not a simulation, not a guess.

Readable verdicts

Full-table reads called out in red, index usage in green, row estimates on every node โ€” even on hidden tests.

Rules, not vibes

No full-table scan, must use the index, one round-trip: pass/fail rules evaluated against the captured plan.

How it works

1

Pick a puzzle

Five tracks, Easy to Hard. Each puzzle states the goal, the constraints, and the bar you have to clear โ€” a time budget, an allocation ceiling, a plan rule, a design rule.

2

Run the samples

Write C# in a full Monaco editor with syntax-aware highlighting and completions. Run visible sample cases โ€” or your own custom input โ€” and iterate fast.

3

Submit for grading

Your solution faces the full hidden suite. Per-test wall-clock time, a time-budget bar, allocated bytes, captured SQL with its query plan, and a character-level diff on every failure.

Your code runs server-side in a hardened, network-isolated sandbox โ€” resource-capped, unprivileged, and destroyed after every run. See exactly what happens โ†’

Built for deliberate practice

One grader, five kinds of judgment โ€” every dimension measured where it can't be faked.

Allocations, measured by the GC

Every test reports server-measured elapsed time against its budget plus managed-heap allocations โ€” median of repeated runs, so a GC pause can't flip your verdict. Some puzzles set hard budgets: a 100 KB input under a 16 KB allocation ceiling forces the in-place solution.

Real database, real plans

Database puzzles run on a real PostgreSQL instance seeded for your submission. Expand any test to see every SQL statement your LINQ produced, what it cost, and the plan the engine chose.

Structure, measured by Roslyn

Refactoring katas parse your source and measure it: cyclomatic complexity, nesting depth, method length, duplicate blocks. The tests stay green โ€” the mess has to go.

Architecture rules as tests

Dependency direction, layering, abstractions, and sealed types are verified on every submission โ€” a wrong dependency fails the grade, not a code review three weeks later.

Graded against real attacks

Secure-coding puzzles run a second, adversarial suite: traversal strings, catastrophic-backtracking inputs, forged log lines, decompression bombs. Exploits blocked and behavior preserved โ€” both, or no pass.

Stuck? Reveal the solution

Give up gracefully: load a correct, optimal reference solution into the editor, study it, then reset and try to beat it from memory.

The gym, not the course

Courses and tutorials are where you learn. This is where you find out โ€” and where it sticks.

You watch

Video courses

Great for absorbing new concepts โ€” but nothing measures whether you can actually apply them under constraints.

You pass

Interview grinders

Binary right/wrong on correctness, optimized for getting hired. An O(nยฒ) pass teaches the wrong lesson.

You get sharper

The proving ground

Graded on the qualities production actually judges: speed, memory, query plans, structure, security, design. Optimized for being better at the job.

Learn anywhere. Get sharp here. Built by a working .NET engineer and educator โ€” for the engineers who want their practice to count.

Simple pricing

Start free, no credit card. Upgrade when you want all five tracks and every gate.

Free

$0/mo

Everything you need to get hooked. No credit card.

Pro

$9/mo

or $54/yr โ€” Founder pricing โ€” 6 months free

The full proving ground: every track, every gate, no daily cap.

Compare plans in detail โ†’

Step onto the mat ๐Ÿฅ‹

Pick a puzzle, press Run, and see how fast your C# really is.

Start solving โ€” it's free