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. 
Determine the minimum number of platforms needed at a railway station so that no train has to wait.
• Sort the arrival and departure times arrays in ascending order.

• Initialize two pointers for arrival and departure times, and a variable to keep track of the maximum number of platforms needed.

• Increment the platform count when a train arrives and decrement when a train departs.

• Update the maximum platform count as needed.

• Ret
Answered by AI
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. 
Determine if it is possible to split a string into three non-empty substrings where one is a substring of the other two.
• Check if any substring of the string is a substring of the other two substrings.

• Iterate through all possible divisions of the string into three non-empty substrings.

• Use two pointers to find all possible substrings efficiently.
Answered by AI
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. 
The task is to find the minimum number of operations required to create a valid path from node A to node B by reversing edges in a directed graph.
• Iterate through the graph to find the shortest path from node A to node B.

• Use a graph traversal algorithm like BFS or DFS to explore possible paths.

• Track the number of edge reversals needed to reach node B from node A.

• Consider edge directions and reverse them as needed to cre...read more
Answered by AI
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. 
The problem involves determining the lexicographic permutation rank of a distinct string.
• Iterate through all permutations of the string and compare with the given string to determine the rank.

• Use a recursive function to generate all permutations of the string.

• Keep track of the count of permutations smaller than the given string to determine the rank.
Answered by AI
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. 
Implement a function to find the maximum possible height of a stack of boxes given their dimensions.
• Create all possible rotations of each box to consider all orientations for stacking

• Sort the boxes based on their base dimensions in non-increasing order

• Use dynamic programming to find the maximum height of the stack
Answered by AI
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?
Ans. 
Effective paging techniques help reduce page faults, which are counted by tracking the number of times a page is accessed from disk.
• Implementing LRU (Least Recently Used) algorithm to replace the page that has not been used for the longest time.

• Using FIFO (First In, First Out) algorithm to replace the oldest page in memory.

• Utilizing optimal page replacement algorithm to replace the page that will not be used for the lo...read more
Answered by AI
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
Ans. 
Implement a function to process queries on a binary matrix by flipping elements and counting zeros in rows/columns.
• Create a binary matrix with all elements initialized to 0.

• Process queries of type 1 by flipping elements in the specified row/column.

• Process queries of type 2 by counting the number of zeros in the specified row/column.

• Return the count of zeros for type 2 queries.

• Ensure to handle the constraints provided i
Answered by AI
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
Ans. 
The task is to find the length of the longest increasing path in a matrix starting from a given cell.
• Create a recursive function to explore all possible paths from the starting cell, keeping track of the length of each path.

• Use dynamic programming to avoid redundant calculations and optimize the solution.

• At each cell, check if moving to the right or down is possible and leads to an increasing path.

• Update the length of ...read more
Answered by AI
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
Ans. 
Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.
• Create an array 'dp' to store the maximum money that can be stolen up to the i-th house.

• Iterate through the houses and update 'dp' based on whether the current house is stolen or not.

• Return the maximum value in 'dp' as the answer.
Answered by AI
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?
Ans. 
Designed a scalable system for Pastebin with various requirements.
• Implemented a distributed system architecture to handle high traffic and ensure reliability.

• Used load balancing techniques to evenly distribute incoming requests across multiple servers.

• Implemented data sharding to partition data across multiple databases for efficient storage and retrieval.

• Utilized caching mechanisms to improve performance and reduce la...read more
Answered by AI
Add your answer