Dynamic Human Labeling / Task Scheduling

CodingOpenAILast reported July 2026Medium Frequency
Reported
5× across candidate reports
First seen
March 2026
Last reported
July 2026
Reported outcome
mixed

Problem Overview

OpenAI coding question, reconstructed from 5 candidate reports (March 2026 to July 2026). Tests: stateful class design; heaps, top-k and greedy scheduling. Candidates reported 2 follow-ups. The write-up includes a Python solution that passes 4 test cases.

  • 2 candidate-reported follow-ups — the probes candidates report being asked, with the trigger for each
  • The full problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full OpenAI catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every OpenAI question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Follow-ups candidates reported, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The follow-ups candidates reported, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?