BioPresence Programmer Challenge

Question 1 · Algorithms / Architecture · Extreme

Algorithm challenge 13: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

A Count-Min Sketch alone gives exact answers Misra-Gries can identify candidates but exact counts need more information or another pass Bloom filters give exact frequencies Reservoir sampling guarantees exact top-k

Question 2 · Algorithms / Architecture · Extreme

Algorithm challenge 16: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

A Count-Min Sketch alone gives exact answers Misra-Gries can identify candidates but exact counts need more information or another pass Bloom filters give exact frequencies Reservoir sampling guarantees exact top-k

Question 3 · Malbolge / Esoteric Reasoning · Extreme

Malbolge reasoning 6: Explain why deterministic static analysis of a nontrivial Malbolge program is unusually difficult. Mention at least two properties of the language that make ordinary debugging or symbolic execution painful.

Question 4 · Algorithms / Architecture · Extreme

Algorithm challenge 4: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

A Count-Min Sketch alone gives exact answers Misra-Gries can identify candidates but exact counts need more information or another pass Bloom filters give exact frequencies Reservoir sampling guarantees exact top-k

Question 5 · Algorithms / Architecture · Extreme

Algorithm challenge 14: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

A Count-Min Sketch alone gives exact answers Misra-Gries can identify candidates but exact counts need more information or another pass Bloom filters give exact frequencies Reservoir sampling guarantees exact top-k

Question 6 · Malbolge / Esoteric Reasoning · Extreme

Malbolge reasoning 12: Explain why deterministic static analysis of a nontrivial Malbolge program is unusually difficult. Mention at least two properties of the language that make ordinary debugging or symbolic execution painful.

Question 7 · Malbolge / Esoteric Reasoning · Extreme

Malbolge reasoning 3: Explain why deterministic static analysis of a nontrivial Malbolge program is unusually difficult. Mention at least two properties of the language that make ordinary debugging or symbolic execution painful.

Question 8 · Algorithms / Architecture · Extreme

Algorithm challenge 23: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

A Count-Min Sketch alone gives exact answers Misra-Gries can identify candidates but exact counts need more information or another pass Bloom filters give exact frequencies Reservoir sampling guarantees exact top-k

Question 9 · C++ Systems · Extreme

C++ challenge 26: In a lock-free stack using compare_exchange_weak with std::memory_order_release on push and std::memory_order_acquire on pop, which failure order is valid and least constraining when the success order is acquire?

memory_order_release memory_order_acq_rel memory_order_relaxed memory_order_consume only

Question 10 · Algorithms / Architecture · Extreme

Algorithm challenge 2: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

A Count-Min Sketch alone gives exact answers Misra-Gries can identify candidates but exact counts need more information or another pass Bloom filters give exact frequencies Reservoir sampling guarantees exact top-k

Advanced Freelance Programmer Screening

Algorithm challenge 13: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

Algorithm challenge 16: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

Malbolge reasoning 6: Explain why deterministic static analysis of a nontrivial Malbolge program is unusually difficult. Mention at least two properties of the language that make ordinary debugging or symbolic execution painful.

Algorithm challenge 4: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

Algorithm challenge 14: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

Malbolge reasoning 12: Explain why deterministic static analysis of a nontrivial Malbolge program is unusually difficult. Mention at least two properties of the language that make ordinary debugging or symbolic execution painful.

Malbolge reasoning 3: Explain why deterministic static analysis of a nontrivial Malbolge program is unusually difficult. Mention at least two properties of the language that make ordinary debugging or symbolic execution painful.

Algorithm challenge 23: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?

C++ challenge 26: In a lock-free stack using compare_exchange_weak with std::memory_order_release on push and std::memory_order_acquire on pop, which failure order is valid and least constraining when the success order is acquire?

Algorithm challenge 2: You need exact top-k frequent items from a stream too large for memory, with adversarial keys and no second pass. Which statement is correct?