RejectedSDE at Nutanix
- Difficulty
- Process took
- 0-1 Weeks
- Rounds
- 3
- Format
- Remote
- Applied via
- Other
How it went
- On-campus drives can sometimes be unpredictable due to many factors, so always be prepared for processes to change last-minute.
What they would tell you
- On-campus drives can sometimes be unpredictable due to many factors, so always be prepared for processes to change last-minute.
How to prepare
- Do DSA hard and medium coding problems, especially those related to trees and arrays.
Their background
I am a final year student from a NIT, maintaining a CGPA above 8.0. I’ve always enjoyed solving challenging coding problems and have regularly participated in coding contests.
Round by round
- 1
Online Assessment20 min
- Shortlisting: Students with CGPA ≥ 8.0
- Number Selected for Interviews: 30
- 2
Data Structures & Algorithms60 min
Purely DSA focused. I was given two questions: The first was quite challenging: Binary Tree Maximum Path Sum The second was a medium-hard problem: Increasing Triplet Subsequence I managed to solve the hard problem without help and needed a few hints for the second. After this round, only 10 out of the initial 30 made it through to the next stage.
- 3
System Design & Concepts60 min
This was a system design round that started with rapid-fire conceptual questions, things like query optimization strategies, cache design, indexing, and best practices for API design. Afterwards, I was asked to put that knowledge into practice by designing a system on the spot. I talked through my ideas, tried to structure my thoughts clearly.
What came up
A candidate-reported account, lightly edited. Interview processes change by team and date.