Interview Experience
LeetCode #543: Diameter of Binary Tree. Difficulty: Easy. Topics: Tree, Depth-First Search, Binary Tree. Asked at Nutanix in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a candidate experience report from a nutanix interview for a swe role during the coding round.
It covers the following topics: Binary Tree, Depth-First Search, Tree, Binary Tree, Graph .
Difficulty rating: Easy
More Nutanix Interview Questions
1p3a
Nutanix IC4/5 Software Engineer HackerRank Online Assessment
1p3a
Nutanix Interview Experience for MTS-1 with 1.5 Years Experience
GeeksforGeeks
Nutanix Interview Experience for MTS - QA (4+ year experience) [ Language - Python ]
GeeksforGeeks
Nutanix Interview Experience | Systems Reliability Engineer |2025
LeetCode
#1290 Convert Binary Number in a Linked List to Integer