Check out your Company Bowl for anonymous work chats.
Bowls
Get actionable career advice tailored to you by joining more bowls.
Followed companies
Stay ahead in opportunities and insider tips by following your dream companies.
Job searches
Get personalized job recommendations and updates by starting your searches.
Nutanix interviews FAQs
Member of Technical Staff - Intern applicants have rated the interview process at Nutanix with 3.3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 82.6% positive. This is according to Glassdoor user ratings.
Candidates applying for Member of Technical Staff - Intern roles take an average of 14 days to get hired, when considering 11 user submitted interviews for this role. To compare, the hiring process at Nutanix overall takes an average of 30 days.
Common stages of the interview process at Nutanix as a Member of Technical Staff - Intern according to 11 Glassdoor interviews include:
Skills test: 26%
One on one interview: 18%
Background check: 12%
IQ intelligence test: 9%
Personality test: 9%
Presentation: 9%
Other: 6%
Phone interview: 6%
Drug test: 3%
Group panel interview: 3%
Here are the most commonly searched roles for interview reports -
I applied through an employee referral. The process took 3 weeks. I interviewed at Nutanix
Average interview
Application
I applied through college or university. I interviewed at Nutanix in Aug 2020
Interview
The interview was held online on codepair. The interview of all candidates were held simultaneously and the same questions were asked to everyone. The interviewers were very nice and polite. The questions were all related to Data Structures & Algorithms.
Interview questions [2]
Question 1
Part 1: A rooted n-ary tree is given with n vertices each having a value. A value k is given. Find the vertex closest to the root having value greater than k.
Part 2: Optimize the above solution for multiple queries of k.
Part 1: A rooted skewed tree is given with an insect sitting on root node at time 0. Every second the insect jumps to one of the children nodes of the current node. Find the probabilities of the insect existing at each node.
Part 2: The tree is not skewed
Part 3: The tree is a directed acyclic graph
Part 4: The tree is a directed graph with cycles. The insect can move from one node to any other node within a cycle in negligible time.
Intro Manager Chat -> Online Assessment -> Technical Interview (LC Easy/Medium, with follow-up questions) -> Behavioural Interview with Manager.
Prompt responses from the HR team, smooth process. I would recommend interviewing with Nutanix!
I applied through college or university. The process took 1 week. I interviewed at Nutanix (Bangalore Rural)
Interview
OA: 2 coding questions (1 easy ,1 medium) and 10 MCQ on cs fundamental
Round 1: 1 coding question (medium) and 1 add-on on that question
Round 2: OS coding debug round
Round 3: Managerial round on resume
Interview questions [1]
Question 1
OS Debug round based on producer - consumer problem
I applied online. The process took 7 weeks. I interviewed at Nutanix (Belgrade, Central Serbia) in Dec 2024
Interview
I applied for the internship position at Nutanix and was invited to complete an online coding test on HackerRank, which consisted of four coding tasks designed to evaluate my problem-solving and programming skills.
After successfully completing the test, the Nutanix team reached out to schedule two technical interviews. The interviewers were incredibly pleasant and friendly, creating a welcoming and comfortable atmosphere. They led the interviews very smoothly, ensuring that the discussions were both engaging and insightful. Throughout the process, the team was extremely helpful, flexible, and professional.
This experience allowed me to showcase my abilities while gaining valuable insights into Nutanix's collaborative and innovative work culture.
Interview questions [1]
Question 1
They asked me about project I worked on, challenges met on the way, and how I managed to solve them.