Practice
Prepare for Jane Street
The problems worth doing for this kind of loop — grouped by what the round tests, not by leaked question lists.
8 problemsClear filters
| Status | Problem | Format | Level |
|---|---|---|---|
| Not started | Design a limit order bookdata-structureslldlow-latencytrading | Written | hard |
| Not started | Design a market data distribution systemlock-freelow-latencymarket-datasystem-design | Written | hard |
| Not started | Fewest machines to finish by a deadlinebinary-searchgreedyoptimisation | Written | hard |
| Not started | Take-home: trade reconciliationcorrectnessdatatake-hometrading | Written | hard |
| Not started | The ABA problematomicsc++concurrencylock-free | Written | hard |
| Not started | Was double-checked locking ever actually broken?c++concurrencymemory-modelsingleton | Written | hard |
| Not started | What does memory_order_relaxed actually guarantee?atomicsc++concurrencymemory-model | Written | hard |
| Not started | What is the hardest technical problem you have solved?behavioralstartechnical-depth | Written | hard |