Filter interviews by
I applied via Newspaper Ad and was interviewed in Aug 2022. There were 2 interview rounds.
I applied via PrepInsta and was interviewed in Sep 2021. There were 3 interview rounds.
Round duration - 80 minutes
Screening Test was on Hackerrank platform 80 minutes consist of 10 MCQs and 2 Coding questions
Round duration - 60 minutes
The interviewer was Very friendly and polite. He asked me to code the solution of 2 problems.
Round duration - 60mins
The Interview was taken by a Senior Technical Manager (11 years experience). He was polite and very knowledgeable with basic concepts. The Interview lasted for around 1 hr.
I applied via Naukri.com and was interviewed before Jul 2022. There were 5 interview rounds.
I applied via LinkedIn and was interviewed before Sep 2021. There were 4 interview rounds.
Nutanix interview questions for popular designations
I was interviewed in Jul 2021.
Round duration - 90 Minutes
Round difficulty - Medium
Timing: Scheduled in the morning 11 AM
test had 1 string based question, 1 greedy and 1 graph based
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Given two arrays:
AT
- represent...The main idea behind this approach is to use an array, 'PLATFORMS', to store the number of platforms required at different points of time. Now, since the time range is from 0 to 2359 in the 24 hour format, we declare the array 'PLATFORMS' with a size of 2360 (as we need values from 0 to 2359) and all values initialized to 0.
Now, we traverse both the arrays together and do the following :
...
You are given a string str
consisting of N
lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha...
The idea here is to check all possible ways to divide a string into 3 substrings and check if there is a string that is a substring of the other two parts. We can divide a string into 3 non-empty substrings:
You are given a directed graph with ‘N’ nodes and ‘M’ edges, along with two specific nodes, ‘A’ and ‘B’. Your task is to find the minimum number of operations required to c...
The idea here is to make the graph undirected by adding all edges in the reverse direction. We will assign weight zero to all edges that are not reversed and weight 1 to all edges that are reversed. Then we will use the Dijkstra algorithm to find the minimum weight path from starting node to the ending node to get the minimum number of operations.
For example:
Below left side directed ...
Round duration - 45 minutes
Round difficulty - Medium
One question was asking.
The above was followed by project discussion.
Given a distinct string, determine the lexicographic permutation rank of the string.
T = 2
S = "abc"
S = "bac"
1
2
Permutation :
Round duration - 30 Minutes
Round difficulty - Medium
Coding question and final year project discussion
Help Ninja to create the tallest stack possible using given 3-D boxes with dimensions Length 'L', Breadth 'B', and Height 'H'. Each box can be rotated to use any side as t...
As we know we can place a box upon another box if the base area is smaller than the previously selected box. So, first of all, we sort the boxes according to the base area. Then we traverse through all the boxes and assume that the ‘i’th’ box is placed at the bottom. Then we try to place all the remaining boxes on this ‘i’th’ box and calculate the maximum height of the stack.
Algorithm:
Round duration - 30 Minutes
Round difficulty - Medium
C basics were asked here. File access, OS concepts, threading
Round duration - 15 Minutes
Round difficulty - Easy
A general background information, inquired about my goals at the company, further studies plans
Tip 1 : Work through your OS based knowledge
Tip 2 : Have a string grip on Data Structures
Tip 3 : Do projects which have OOPs implementation
Tip 1 : Have 2+ projects
Tip 2 : Showcase the subjects that you have learnt in college
Get interview-ready with Top Nutanix Interview Questions
I applied via Approached by Company and was interviewed before Aug 2022. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Jul 2022. There were 4 interview rounds.
I am aware of various e-learning authoring tools such as Articulate Storyline, Adobe Captivate, and Camtasia.
Articulate Storyline
Adobe Captivate
Camtasia
I applied via Naukri.com and was interviewed in Dec 2021. There was 1 interview round.
Selenium 4 has new features like improved W3C support, relative locators, and better error handling.
Improved W3C support for better browser compatibility
Relative locators for easier element location
Better error handling with detailed error messages
New APIs for easier browser automation
Support for Chromium-based Edge browser
Integration with DevTools Protocol for better debugging
Encapsulation is the process of hiding implementation details and exposing only necessary information.
Encapsulation is achieved through access modifiers like public, private, and protected.
It helps in achieving data abstraction and information hiding.
Encapsulation provides better control over the data and prevents unauthorized access.
Example: A class with private variables and public methods to access them.
There are three types of waits in Selenium: Implicit Wait, Explicit Wait, and Fluent Wait.
Implicit Wait: Waits for a certain amount of time before throwing an exception if the element is not found.
Explicit Wait: Waits for a certain condition to occur before proceeding further in the code.
Fluent Wait: Waits for a certain condition to occur with a defined frequency before proceeding further in the code.
I was interviewed in Jan 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was an online coding round which had 2 questions.
You are given a binary matrix with 'M' rows and 'N' columns, initially consisting of all 0s. You will receive 'Q' queries, which can be of four types:
Query 1: 1 R inde...
Given a 2-D matrix mat
with 'N' rows and 'M' columns, where each element at position (i, j) is mat[i][j]
, determine the length of the longest increasing...
Round duration - 45 minutes
Round difficulty - Easy
The next round was a debugging round. There were approximately 20 people in this round and all of us had to give this round simultaneously. 9 people were shortlisted from this round.
Round duration - 60 minutes
Round difficulty - Medium
The first F2F interview was a DSA round. Initial 5 mins went in the introduction. Then I had to log in to the code pair link on hackerrank and the interviewer gave me a question. So the question had sort of like a common premise on which follow-up questions were asked.
A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determi...
Round duration - 60 minutes
Round difficulty - Easy
Tip 1 : Make sure that your aim is not solving as many questions as possible but rather solving questions in a manner that clears your concepts and maximizes your probabillity of being able to solve the next question given to you on that particular topic.
Tip 2 : Make sure you communicate effectively with the interviewer and walk him/her through your approach and solutions.
Tip 1 : Do not cram in stuff. A 1 page resume is more than enough for an entry level position.
Tip 2 : Try and have a neat layout and highlight important points and achievements on your resume.
Some of the top questions asked at the Nutanix interview -
The duration of Nutanix interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 48 interviews
Interview experience
based on 159 reviews
Rating in categories
Member Technical Staff
101
salaries
| ₹14 L/yr - ₹48 L/yr |
System Reliability Engineer
46
salaries
| ₹10.3 L/yr - ₹30.5 L/yr |
Mts1
35
salaries
| ₹16 L/yr - ₹38.4 L/yr |
MTS-4
35
salaries
| ₹26 L/yr - ₹55 L/yr |
Technical Staff Member 3
35
salaries
| ₹20 L/yr - ₹45 L/yr |
Red Hat
VMware Software
Cisco
Dell