Nutanix Mts1 Interview Questions, Process, and Tips

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

Q1. 
Minimum Number of Platforms Problem
Your task is to determine the minimum number of platforms required at a railway station so that no train has to wait.
Explanation:
Given two arrays:
• AT - represent...read more
Ans. Using an additional array
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 :
...read more
Answered Anonymously
Add your answer
Q2. 
Split the String Problem Statement
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...read more
Ans. Brute-force
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:
• A non-empty prefix
• A non-empty suffix
• And a non-empty middle string that is between the ending point of the 1st string and starting point of the 2nd string.
 
Algorithm:
 
• Run a loop from i = 1 to ‘N’...read more
Answered Anonymously
Add your answer
Q3. 
Reverse Edges Problem Statement
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...read more
Ans. Dijkstra algorithm
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 ...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

One question was asking. 
The above was followed by project discussion.

Q1. 
Lexicographic Permutation Rank Problem Statement
Given a distinct string, determine the lexicographic permutation rank of the string.
Example:
Input:
T = 2
S = "abc"
S = "bac"
Output:
1
2
Explanation:
...read more
Ans. Permutations
Permutation :
• Let the given string be “CODING”. In the input string, ‘C’ is the first character. There are a total of 6 characters and 0 of them are smaller than ‘C’. So there can be 0 * 5! smaller strings where the first character is smaller than ‘C’.
• Now let us Fix ‘C’ and find the smaller strings starting with ‘C’.
• Repeat the same process for ‘O’, rank is 0*5! + 4*4! +…
• Now fix ‘O’ and repeat the same proces...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Coding question and final year project discussion

Q1. 
Ninja and Stack of Boxes Problem
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...read more
Ans. Recursive
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:
 
• We decl...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

C basics were asked here. File access, OS concepts, threading

Q1. What are effective paging techniques, and how do you count page faults?
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

A general background information, inquired about my goals at the company, further studies plans

Round duration - 90 minutes
Round difficulty - Medium

It was an online coding round which had 2 questions.

Q1. 
Query and Matrix Problem Statement
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...read more
Add your answer
Q2. 
Longest Increasing Path in Matrix Problem Statement
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...read more
Add your answer

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.

Q1. 
Loot Houses Problem Statement
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...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Can you describe the system design you created for Pastebin and the set of requirements you had to fulfill?
Add your answer