BioPresence Programmer Challenge45:00

Advanced Freelance Programmer Screening

This is a timed technical challenge. Submit your resume and answer the randomized questions. Results are manually reviewed.

Full NameEmailPhone / LinkedInResume PDF/DOC/DOCX

Question 1 · Algorithms / Architecture · Extreme

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

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

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

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

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

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

C++ challenge 21: 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 9 · 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 10 · C++ Systems · Extreme

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