Binary Tree Problems
Trees are a steady part of Nutanix's algorithm rounds. Each problem here starts with a version you can write quickly, and then the interviewer tightens the space or asks for one pass.
In one, you add links the tree doesn't give you, and the hard follow-up takes them away. In another, you start by storing every level and end with one running total.
The third is close to daily work at a storage company, where data has to survive a round trip exactly.
Check the input format before you code. Two of the problems take a level-order array with null for a missing child, and the third takes a parent array, so a node there can have any number of children.
NutanixPremium lesson · Coding round
The 3 Nutanix problems are below.
- A Premium questionCoding · Medium · Signature problem
- A Premium questionCoding · Medium
- 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.