Identify the single orchestrator in an undirected server graph where every connection includes that orchestrator and workers never connect directly to one another.
Company: Netapp
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Identify the single orchestrator in an undirected server graph where every connection includes that orchestrator and workers never connect directly to one another.
Blind 75
75 free coding problems to build your foundations, with hints, explanations, and a progress checklist.
Data Structures & Algorithms
The patterns behind arrays, pointers, trees, graphs and dynamic programming, with worked Python examples.
Cracking the Coding Interview Companion
Our free, unofficial companion to the book: how to analyze, solve and speed up coding problems, in Python.