Dependency Graphs and MST
Nutanix's graph questions go past the usual grid and ordering problems. For MTS-3 and up, the HackerRank assessment keeps coming back to one problem where the word graph never appears in the prompt. You have to recognize a minimum spanning tree from the story, and Prim's on a distance array is the shortest way to write it.
The live rounds bring two Hard graphs where nobody hands you the edges. In one you derive them from an ordering and reject a cycle. In the other you build them from parsed input, then answer two questions about the shape of what you built.
Get the graph right before you reach for an algorithm. The ordering problem ends in the same Kahn loop worked in Graphs & Search, so do that lesson first if topological sort feels rusty. The other needs a different tool, a DFS that remembers the current path.
NutanixPremium lesson · Coding round
The 3 Nutanix problems are below.
- A Premium questionCoding · Medium · Frequently asked
- A Premium questionCoding · Hard
- A Premium questionCoding · Hard
Each with hints, the follow-up and a tested solution.
Get the Nutanix questions$49 a year · all 100 companies · cancel anytime
From 131 Nutanix reports, forum threads behind logins and write-ups in Chinese.
Nutanix interview guideKnow what Nutanix asks before you walk in.
32 coding · 3 system design · 15 behavioral questions
Get their questions first.
InterviewLegend is independent and not affiliated with or endorsed by any company it covers.