OpenAI·Software Engineer·Technical Phone Screen
- You're given a data labeling platform with totalTask, totalModel, totalHuman, and k as inputs. Return a list of [task, model, human] assignment tuples such that every human appears in at least k assignments, no human annotates the same task twice, and all IDs are valid. Return an empty list if no valid schedule exists.
- Follow-up: modify the schedule so it's prefix-balanced. For every prefix of the output list, the number of times each model has been assigned to a task and the number of times each model has been paired with a human must each differ by at most 1 across all models (including models with zero assignments so far).
“Spent the first few minutes just making sure I understood the constraints correctly, because the 'same human can't annotate the same task twice' part interacts weirdly with the k-minimum requirement when totalHuman is large relative to totalTask.”