Nutanix Interview Experience for MTS - QA (4+ year experience) [ Language - Python ]
Question Details
Hi, I was recently interviewed for the MTS -QA position for Nutanix (Location: Bangalore). I have 1.5-year experience in the storage domain. Following were the interview ...
Full Details
Hi, I was recently interviewed for the MTS -QA position for Nutanix (Location: Bangalore). I have 1.5-year experience in the storage domain. Following were the interview questions- Two telephonic round followed by 6 F2F interviews. Telephonic
Round 1 How to check if a string contains a given substring. Find a string in a given list.
Example Input : list l1 = ['aaa', 'a', 'xyz'] string = 'a'
Output : True Find email address in a given string. [use regex] Merge given two list How to debug ping command. If it is not working how you will debug to find out the root cause for the same. You have n number of hosts, how will you search the given string in a given file. How to mount a filesystem on NFS and if it is not working how to debug it. What is your current role and work? Telephonic
Round 2 Print occurrences of words in a given file.
Example Input: a given file having some words - e.g. cat cat dog cat hen hen Output: a file - cat4 dog1 hen2 Shift all zero in the right side in a given list Example Input: [5, 6, 0, 1, 0, 10, 0, 2, 0]
Output: [5, 6, 1, 10, 2, 0, 0, 0, 0] Some questions around the current project. F2F
Round 1 Data Structure and Algorithm Round What are the algorithms to solve the below problems? Write the test cases and code to cover all test cases. What is the time complexity and how can you optimize your solution? merge-k-sorted-arrays-set-2-different-sized-arrays merging-intervals Basics of trees and understanding about heap tree. F2F
Round 2 Given a string, find the count of unique characters present in the string.
Example Input: FUNNY OUTPUT: 4 Now remove the characters till one character is left. FUNNY -> FUNY -> FUY -> FU -> F OUTPUT: F You have one saree of size (nm), fold this with the maximum number of folds ("x") and check if it is able to fit in the pq box. F2F
Round 3 Discussion around the current project. Challenges in projects and automation.
Approach for testing the product. Basics of test frameworks. Given a scenario, write a test class. F2F
Round 4 How to validate if two files are the same or not? What attributes of a file can be checked for validation? [e.g. metadata, content] If the file is too big, file read is not sufficient way to validate files, Is there another way to do validate files?? What is the difference between symlink and hardlink? Explain with inodes? Given file is in a distributed system and file is open at one node for writing and that file is not allowed to be deleted on any other node. Write the test plans for the same. F2F
Round 5 How to check the performance of processes in a UNIX system? In a distributed system, NodeA is able to ping nodeB, but B is not able to ping A. How to debug this issue? How files stored in a UNIX system? Difference between a static method and a class method Write test code for below - you have to check if a given file is readable or not 1. if the file is readable - pass 2. if the file is not readable - and having error msg - "xyz" - fail 3. if the file is not readable and not having error msg - "xyz" - try to read for n time with same above conditions. If file failed for n times then return False Generalize your above code for checking the directory content. Check directory content is readable or not.[Directory can have multiple files.] Suppose you are moving a file from one server to client and file transfer speed is very slow. How will you troubleshoot for the same? F2F
Round 6 Managerial round. Architecture and system level questions. College project and current work related stuff.
About This Question
This is a reported interview question from a nutanix interview for a qa role during the phone screen round reported in 2025.
It covers the following topics: Arrays, Strings, Trees, Heap, System Design .
Topics
More Nutanix Interview Questions
About Nutanix Interview Reports
This question was reported by a candidate who interviewed at Nutanix. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Nutanix are the higher-signal extractions to take from this report.
For broader preparation context, the Nutanix interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Nutanix reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Nutanix Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Nutanix reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.