We use cookies for site analytics. Accept to help us understand how the site is used. See our Privacy Policy for details.
Concurrency problems test whether you can enforce an ordering without busy-waiting or deadlocking - printing in sequence across threads, building H2O in the right ratio, or seating the dining philosophers. The tools are few (mutexes, semaphores, condition variables) and the failure modes are specific, so recognising the shape matters more than raw cleverness. Systems and infrastructure teams weight these heavily.
Ordering guarantees between threads, bounded buffers, or classic synchronisation puzzles.
5 problems. Each one runs in an in-browser editor against real test cases, with hints and a worked solution.
The patterns cheat sheet covers all of these in one page - what each one looks like in a problem statement, and the template that follows.