Nutanix Interview Questions, Process, and Tips

Q1. What are your strengths
Add your answer
Q2. What are your weaknessess
Add your answer

Round duration - 80 minutes
Round difficulty - null
Screening Test was on Hackerrank platform 80 minutes consist of 10 MCQs and 2 Coding questions

Q1. Merge two sorted array
Add your answer
Q2. Remove duplicates from the string
Add your answer

Round duration - 60 minutes
Round difficulty - null
The interviewer was Very friendly and polite. He asked me to code the solution of 2 problems.

Q1. A list/array/vector of string is given. return the first index of repeating elements. The problem was quite straight-forward
Ans. I gave him a brute-force solution using 2 for loops.
Answered by PrepInsta
Add your answer
Q2. The 2nd Problem was standard Parentheses Balance
Ans. I wrote the standard stock solution. We then discussed its corner cases
Answered by PrepInsta
Add your answer

Round duration - 60mins
Round difficulty - null
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.

Q1. Definition of Classes and Objects with relevant examples
Add your answer
Q2. What are static variables?
Add your answer
Q3. What is use of PostgreSQL?
Add your answer
Q4. Write a code to check whether anagram of a given string is palindrome or not.
Add your answer
Q5. Test Scenario for calculator
Add your answer
Q6. Test Scenario for Google Login Page Puzzle about 9 identical coins where 1 coin is of slightly higher weight. TCP vs UDP
Add your answer

Q1. Manager discussion about role and responsibilities.
Add your answer
Q2. Explain about role and responsibilities
Add your answer

Q1. Question related to Database migration.
Add your answer
Q2. Oracle database migration from onprim to cloud
Add your answer

Q1. Oracle database questions
Add your answer

Q1. Oracle database and cloud
Add your answer

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