Nutanix

Role: Not Specified (Software Engineer)

College: Not Specified (On-Campus)

Interview Date: 2025-07-23

Interview Type: On-Campus

Result: Not Specified

Difficulty: Not Specified (Coding problems seem Medium-Hard)

Rounds: 5 rounds (Online Test, Round 1 - Coding, Round 2 - Knockout/Debugging, Round 3 - F2F 1, Round 4 - F2F 2, Round 5 - HR)

Topics Asked: Data Structures, Algorithms (Subsets with sum X, WELL and DISC problem, Bounded Buffer problem), Debugging, HR Questions

Experience:

This experience describes an on-campus recruitment process by Nutanix.

Online Test: Not detailed in this snippet.

Round 1 - Coding: This round involved two questions. The first was to find all subsets of an array of integers whose sum equals a given integer X. The solution involved recursion for two cases (including and excluding the current element). The second question involved two integer arrays, WELL and DISC, to determine how many discs of varying widths could fit into the WELL.

Round 2 - Knockout (Debugging): An erroneous code for a segment tree was provided on paper. Candidates had to identify the mistake and write the correct code. 8 out of 16 students were selected from this round.

Round 3 - F2F 1: This was a face-to-face interview with two questions. One involved a variant of the classic bounded buffer problem, where synchronization was required.

Round 4 - F2F 2: This round had only one question, which was a variant of the classic bounded buffer problem, and the candidate was asked to synchronize it.

Round 5 - HR: This round consisted of basic HR questions. The interviewer explained the culture at Nutanix and at the end of the interview, told the candidate "Welcome to Nutanix."