nutanix logo
Nutanix· MTS3 | IE

Nutanix | MTS3 | IE (cleared)

Result
Offer
Posted
31 Oct 2025
596 reads

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)

  1. 01

    All Nodes Distance K in Binary Tree

    Data Structures & Algorithms · Medium

    Given 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.

    Open the problem
  2. 02

    Smallest Subsequence of Distinct Characters

    Data Structures & Algorithms · Hard

    Given 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.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Nutanix recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!