Questions
Read the code, predict what happens, then see why. Hand-written questions on C++, Rust, and the systems underneath them.
- False positives and false negatives in a Bloom filterEasy
- Index lookup in a rope built by repeated appendsMedium
- Linear probing vs. separate chaining at 90% loadMedium
- Union-find complexity under partial vs. full optimizationHard
- Total and per-character cost of KMP's failure-link loopHard
- A skip list with level promotion disabledMedium
- Floyd-Warshall's all-pairs shortest path complexityEasy
- A treap whose priorities come from an insertion counterMedium
- Modulo sharding vs. consistent hashing when a node is addedEasy
- Randomized Lomuto quicksort on an array of identical keysHard
- Re-sorting by a second key with std::sortEasy
- Kruskal vs. Prim on dense vs. sparse graphsMedium
- An LRU cache built from a hash map and a linked listHard
- Kahn's algorithm on a graph containing a cycleMedium
- Fibonacci heap decrease-key and Dijkstra's asymptotic complexityHard
- Erasing from a linear-probing table by emptying the slotMedium
- A splay tree after ascending inserts, followed by find(1)Hard
- Two-pointer shortest subarray with sum at least kMedium
- Range query complexity in a B+-treeMedium
- van Emde Boas insert with and without a separately stored minimumHard
1–20 of 46
Page 1 of 3