Distributed Machine Count (Tree Network)

CodingOpenAILast reported August 2026High Frequency

Reported: 29× across candidate reports
First seen: January 2025
Last reported: August 2026
Reported outcome: mixed

Problem Overview

You are given an n-ary tree where each node represents a machine in a distributed cluster. Each node knows its own ID, its parent node (null if root), and its list of children. Nodes can only communicate with their direct parent or children via two provided APIs: sendAsyncMessage(nodeId, message_string) (treat…

3 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
The rest of the 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. Verbatim follow-ups, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.