I applied through an employee referral. The process took 2 weeks. I interviewed at Nutanix (Belgrade, Central Serbia) in Feb 2025
Interview
3 technical interviews, 2 with other software engineers and final with engineering manager. Interviews are scheduled in advance and you are asked when you are available for interviews. After few weeks you are notified about the outcome.
Interview questions [1]
Question 1
Implementation of priority semaphore.
Implementation of file naming procedure in file system.
I applied online. I interviewed at Nutanix (Belgrade, Central Serbia) in Jun 2026
Interview
The interview process started with an initial contact from HR, who introduced me to the role and explained the next steps in the selection process. After that, I had three technical interviews focused on my technical knowledge, problem-solving skills, previous projects, and relevant experience. The final step was a conversation with the manager, which was more focused on my background, motivation, communication, and overall fit for the team.
Interview questions [1]
Question 1
They asked me an algorithms question in the form of a LeetCode-style coding task, where I had to explain my approach, solve the problem, and discuss time and space complexity.
I applied online. I interviewed at Nutanix in Feb 2023
Interview
The interview consists of four rounds. First round is coding assignment done on HackerRank coding platform. You receive a link for this test which consists of three coding tasks. After this round, you receive a call for the live coding interview with some of the senior engineers. There are three 1:1 coding interviews in total and you can be eliminated after the first one. At the end of the interview process, you have a meeting with a Talent Advisor who gives you a feedback.
Interview questions [1]
Question 1
Questions were related to testing your problem solving skills and designing algorithms to solve a specific problem. Standard data structures are used to implement the solution (Maps, Lists, Arrays, Stacks, Queues, Trees and Graphs).