BioPresence Programmer Challenge

Question 1 · Algorithms / Architecture · Extreme

Algorithm challenge 3: 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 · C++ Systems · Extreme

C++ challenge 42: 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 3 · 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 4 · Malbolge / Esoteric Reasoning · Extreme

Malbolge reasoning 19: 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 5 · Algorithms / Architecture · Extreme

Algorithm challenge 18: 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 · C++ Systems · Extreme

C++ challenge 4: 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 7 · C++ Systems · Extreme

C++ challenge 47: 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 8 · Algorithms / Architecture · Extreme

Algorithm challenge 17: 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 · Malbolge / Esoteric Reasoning · Extreme

Malbolge reasoning 17: 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 10 · C++ Systems · Extreme

C++ challenge 22: 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

Advanced Freelance Programmer Screening

Algorithm challenge 3: 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 42: 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 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 19: 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 18: 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 4: 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?

C++ challenge 47: 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 17: 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 17: 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.

C++ challenge 22: 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?