Nutanix | MTS3 | IE (cleared)
- Result
- Offer
- Posted
- 31 Oct 2025
Summary
Successfully cleared the Nutanix interview process for the MTS3 | IE role. The interview included a mix of coding, system design, and behavioral rounds, with a strong emphasis on problem-solving and code quality.
How it went
🧩 Hiring Drive Experience
R1
[All Nodes Distance K in Binary Tree](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/description/)
Follow-up
Solve without using extra memory.
R2
[Smallest Subsequence of Distinct Characters](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters/description/)
Follow-up
Modify to get the largest subsequence.
R3
Distributed Job Scheduler – Machine Coding, focus on thread safety, strong focus on writing modular code.
R4
MoveInSync – High-level design (routing matching, schedules etc).
R5
Hiring Manager Round – Discussion around projects, approach, and salary.
R6
Key-Value DB – Discussed CAP trade-offs and master-slave design.
(This additional round was conducted as they couldn’t finalize candidates after R5 — a bit unusual.)
[Offer Details](https://leetcode.com/discuss/post/7168779/offer-evaluation-india-by-anonymous_user-wqxk/)
Questions asked (2)
- 01
All Nodes Distance K in Binary Tree
Data Structures & Algorithms · Medium
Open the problemGiven a binary tree, find the distance between any two nodes in the tree. The problem can be solved using a BFS approach starting from the target node, considering the parent pointers.
- 02
Smallest Subsequence of Distinct Characters
Data Structures & Algorithms · Hard
Open the problemGiven a string, find the smallest subsequence of distinct characters that can be formed by removing some characters from the string. The problem requires maintaining the order of characters and selecting the minimum length subsequence.