AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Nutanix Mts1 Interview Questions and Answers
10 Interview questions
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 th...
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
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 that...
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.
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:
...
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.
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 t...
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 cr...
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 t...
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- representi...
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 neede...
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 ...
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 lengt...
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 index
...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 provi...
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. Determin...
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.
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 redu...
Nutanix Mts1 Interview Experiences
2 interviews found
I appeared for an interview in Jul 2021.
(3 Questions)
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...
- 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...
- Q2.
Split the String Problem Statement
You are given a string
strconsisting ofNlowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha... - 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.
- 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...
- 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...
(1 Question)
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
2Explanation:
... - 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.
(1 Question)
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...
- 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
(1 Question)
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...
Round duration - 15 Minutes
Round difficulty - Easy
A general background information, inquired about my goals at the company, further studies plans
Interview Preparation Tips
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
Skills evaluated in this interview
I appeared for an interview in Jan 2021.
(2 Questions)
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... - 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...
- Q2.
Longest Increasing Path in Matrix Problem Statement
Given a 2-D matrix
matwith 'N' rows and 'M' columns, where each element at position (i, j) ismat[i][j], determine the length of the longest increasing... - 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 ...
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.
(1 Question)
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...
- 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.
(1 Question)
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...
Interview Preparation Tips
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.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I appeared for an interview before Sep 2020.
(2 Questions)
Round duration - 140 minutes
Round difficulty - Hard
2 Separate online rounds were hosted on HackerRank . Online Aptitude Round consisted of 45 questions. Online Coding Round consisted of 3 questions.
- Q1.
Maximum Sum Problem Statement
You are given an array
ARRof N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio... - Ans.
The task is to maximize the sum of selected elements from an array by following specific rules.
Select elements strategically to maximize the sum
Remove occurrences of selected element, and its neighbors
Repeat the process until the array becomes empty
- Q2.
Rearrange The Array Problem Statement
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
Example:
Inpu...
- Ans.
The task is to rearrange an array such that no two adjacent elements are the same.
Iterate through the array and check if any adjacent elements are the same.
If adjacent elements are the same, swap one of them with a different element.
Return 'YES' if a valid rearrangement is possible, 'NO' otherwise.
(2 Questions)
Round duration - 40 minutes
Round difficulty - Hard
The interview started of with questions about the online test, general questions on “tell me about yourself”
Then he asked me a relative velocity problem from physics section to warm things up.
It was Followed by discussion on topics taught in college, Questions on OS and DBMS.
- Q1.
Ways to Reach Nth Stair
Given the number of stairs, initially at the 0th stair, you need to reach the Nth stair. Each time, you can either climb one step or two steps. Determine the number of distinct way...
- Ans.
Calculate the number of distinct ways to climb N stairs by either taking one or two steps at a time.
Use dynamic programming to keep track of the number of ways to reach each stair
The number of ways to reach a stair is the sum of the number of ways to reach the previous two stairs
Return the result modulo 10^9+7
- Q2.
Level Order Traversal of Binary Tree
Given a binary tree of integers, return its level order traversal.
Input:
The first line contains an integer 'T' which represents the number of test cases. For each ...
- Ans.
Level Order Traversal of Binary Tree returns nodes in level order traversal.
Perform a level order traversal of the binary tree starting from the root node.
Visit nodes level by level, printing them in the order they are encountered.
Use a queue data structure to keep track of nodes at each level.
(3 Questions)
Round duration - 50 minutes
Round difficulty - Easy
The interviewer asked about my project – the idea of the project, the challenges I faced etc. She also asked some OS concepts like CPU scheduling, multi-queue scheduling, mutex, deadlocks.
- Q1.
Left View of a Binary Tree Problem Statement
Given a binary tree, your task is to print the left view of the tree.
Example:
Input:
The input will be in level order form, with node values separated by a...
- Ans.
The task is to print the left view of a binary tree given in level order form.
Traverse the tree level by level and print the first node of each level (leftmost node).
Use a queue to keep track of nodes at each level.
Consider null nodes as well while traversing the tree.
- Q2.
Top View of Binary Tree Problem Statement
Given a binary tree, your task is to print the Top View of the Binary Tree. The Top View is the set of nodes visible when the tree is viewed from the top. Please ...
- Ans.
The task is to print the Top View of a Binary Tree, which is the set of nodes visible when viewed from the top, in left to right order.
Traverse the binary tree in level order and maintain a map to store the horizontal distance of each node from the root.
For each node, if the horizontal distance is not already in the map, add the node's value to the result.
Print the values from the map in ascending order of horizontal d...
- Q3. Design a system that can store an incoming stream of characters in a sorted manner and answer queries regarding whether a specific character is present or not.
- Ans.
Design a system to store incoming characters in sorted manner and answer queries about character presence.
Use a data structure like a balanced binary search tree to store characters in sorted order.
Implement functions to insert characters into the tree and check for character presence.
Optimize search queries by using binary search or tree traversal techniques.
Consider edge cases like duplicate characters and handling s...
Interview Preparation Tips
Tip 1 : Be solid with the basics of Ds, Algo. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer
Tip 1 : Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2 : Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3 : It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.
Skills evaluated in this interview
I applied via Recruitment Consulltant and was interviewed in Jun 2022. There were 2 interview rounds.
1 hour 30 minutes, questions were based on coding, aptitude
(1 Question)
- Q1. Interviewer asked two coding questions.
Interview Preparation Tips
R.Kaushik
Interview Preparation Tips
Skills:
College Name: NIT Surathkal
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
This was an online Coding+MCQ round. Both the coding questions were related to DP and were of Medium to Hard Difficulty.The MCQ's were of easy-medium level but one has to be fast in order to complete the section in the given time frame.
- Q1.
Maximum Sum Problem Statement
You are given an array
ARRof N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio... - Ans.
Given an array, select elements to maximize sum by removing adjacent elements.
Iterate through the array and keep track of the count of each element.
Select the element with the highest count first, then remove adjacent elements.
Repeat the process until the array is empty and sum the selected elements.
- Q2.
Longest Common Prime Subsequence Problem Statement
Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...
- Ans.
Find the length of the longest common prime subsequence between two arrays of integers.
Iterate through both arrays to find prime numbers
Use a set to keep track of common prime numbers
Return the size of the set as the length of the longest common prime subsequence
(4 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.
- Q1.
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...
- Ans.
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.
Once the loop is detected, use two pointers to find the start of the loop.
Adjust the pointers to remove the loop and return the modified linked list.
- Q2.
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
... - Ans.
Implement a stack using two queues to store integer values with specified functions.
Create a stack class with two queue data members.
Implement push(data), pop(), top(), size(), and isEmpty() functions.
Use one queue for pushing elements and another for temporary storage during operations.
Ensure proper handling of edge cases such as empty stack.
Example: If input is Q = 5, 1 42, 2, 3, 1 17, the output should be 42, -1, 17...
- Q3. What are Vtable and VPTR in C++?
- Ans.
Vtable and VPTR are used in C++ for implementing polymorphism through virtual functions.
Vtable (Virtual Table) is a table of function pointers used to implement dynamic dispatch in C++ for virtual functions.
VPTR (Virtual Pointer) is a pointer that points to the Vtable of an object, allowing dynamic binding of virtual functions at runtime.
Vtable is created for each class that has virtual functions, containing pointers t...
- Q4. What are friend functions in C++?
- Ans.
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
Friend functions are declared inside a class with the keyword 'friend'.
They can access private and protected members of the class.
They are not member functions of the class, but have the same access rights as member functions.
Example: friend void displayDetails(Student);
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This round had 3 preety good questions related to DSA and some questions revolving around Memory Management and Operating Systems.
- Q1.
Predecessor and Successor in Binary Search Tree (BST)
Given a binary search tree (BST) with 'N' nodes, find the predecessor and successor of a given 'KEY' node in the BST.
Explanation:
The predecessor o...
- Ans.
Find predecessor and successor of a given node in a binary search tree (BST).
Predecessor is the node visited just before the given node in an inorder traversal.
Successor is the node visited immediately after the given node in an inorder traversal.
Return -1 if predecessor or successor does not exist.
Implement inorder traversal to find predecessor and successor.
- Q2.
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
- Ans.
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Apply modulo operation to avoid overflow while calculating the result.
Consider using me...
- Q3.
Good Arrays Problem Statement
You are given an array 'A' of length 'N'. You must choose an element from any index in this array and delete it. After deleting the element, you will obtain a new array of le...
- Ans.
Given an array, find the number of 'good' arrays that can be formed by deleting one element.
Iterate through each element in the array and check if deleting it results in a 'good' array
Keep track of the sum of elements at odd and even indices to determine if the array is 'good'
Return the count of 'good' arrays
- Q4. What is memory protection in operating systems?
- Ans.
Memory protection in operating systems prevents one process from accessing or modifying the memory of another process.
Memory protection ensures that each process has its own isolated memory space.
It prevents unauthorized access to memory locations, improving system stability and security.
Operating systems use techniques like virtual memory and access control lists to enforce memory protection.
Examples include segmentat...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Member Technical Staff Interview Questions & Answers
VMware Software
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Th interviewer asked me questions related to various topics of OS, Data Structures and Algorithm.
Tips: Have a strong hold on topics of OS like segmentation and buddy systems.
- Q1. What is segmentation?
- Ans.
Segmentation is the process of dividing a larger entity into smaller parts or segments.
Segmentation is commonly used in image processing to separate objects of interest from the background.
It is also used in marketing to divide a target market into smaller groups based on demographics, behavior, or other factors.
In networking, segmentation refers to dividing a network into smaller subnetworks to improve performance and...
- Q2. What are the advantages and disadvantages of the buddy system?
- Ans.
The buddy system has advantages like increased safety and support, but also drawbacks like dependency and lack of independence.
Advantages: increased safety, support, accountability, motivation
Disadvantages: dependency, lack of independence, potential for conflicts
Example: In a buddy system at work, colleagues can support each other in completing tasks and provide motivation to stay on track.
Example: However, relying to...
- Q3. What is a page fault?
- Ans.
A page fault occurs when a program tries to access a page of memory that is not currently in physical RAM.
Occurs when a program tries to access a page of memory not in physical RAM
Results in the operating system needing to retrieve the page from disk
Can lead to a temporary pause in program execution
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
The round consisted of questions of heap, Towers of hanoi and other questions related to CV.
Tips: Time complexity analysis of Towers of Hanoi Problem is important. Good skillset in DS and Algorithms, Bit Manipulation.
- Q1.
Tower of Hanoi Problem Statement
You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...
- Ans.
Tower of Hanoi problem where 'N' disks need to be moved to another rod following specific rules in less than 2^N moves.
Implement a recursive function to move disks from one rod to another following the rules.
Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.
Maintain a count of moves and track the movement of disks in a 2-D array/list.
Ensure that larger disks are not placed on...
- Q2.
Convert Array to Min Heap Task
Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.
A min-binary heap is a complete binary tree where each internal node's va...
- Ans.
Convert the given array into a min-binary heap by modifying the array elements.
Iterate through the array and heapify each node starting from the last non-leaf node to the root node.
For each node, compare it with its children and swap if necessary to satisfy the min-heap property.
Continue this process until the entire array is converted into a min-heap.
Round duration - 30 minutes
Round difficulty - Easy
The HR asked about my hobbies, extra curricular activities and checked my personality.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
15 Questions
- Q1. How to find a loop in a Linked List and how to remove it
- Ans.
To find and remove a loop in a Linked List, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, slow and fast, to detect if there is a loop in the Linked List
If the two pointers meet at some point, there is a loop
To remove the loop, set one of the pointers to the head of the Linked List and move both pointers one step at a time until they meet again
The meeting point is the start of the loop, set the next poi...
- Q2. Suppose there is an unsorted array. What will be the maximum window size, such that when u sort that window size, the whole array becomes sorted. Eg, 1 2 6 5 4 3 7 . Ans: 4 (6 5 4 3)
- Ans.
Find the maximum window size to sort an unsorted array.
Identify the longest decreasing subarray from the beginning and longest increasing subarray from the end
Find the minimum and maximum element in the identified subarrays
Expand the identified subarrays until all elements in the array are covered
The length of the expanded subarray is the maximum window size
- Q3. How to find longest last occurring word in a sentence with multiple whitespace
- Ans.
Finding the longest last occurring word in a sentence with multiple whitespace.
Split the sentence into words using whitespace as delimiter
Reverse the list of words
Iterate through the list and find the first occurrence of each word
Calculate the length of each last occurring word
Return the longest last occurring word
- Q4. What is merge sort and Quick sort. Adv and Disadv of each and which one would u use to sort huge list and Y
- Ans.
Merge sort and Quick sort are sorting algorithms used to sort arrays of data.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.
Merge sort has a tim...
- Q5. Define Process &thread
- Ans.
Process is an instance of a program while thread is a subset of a process that can run concurrently with other threads.
A process is a program in execution
A process can have multiple threads
Threads share the same memory space as the process
Threads can run concurrently with other threads within the same process
Examples of processes include web browsers, word processors, and media players
Examples of threads include GUI th...
- Q6. What happens when an recursive function is called
- Ans.
A recursive function calls itself until a base case is reached, then returns the result to the previous call.
Each call creates a new instance of the function on the call stack
The function continues to call itself until a base case is reached
Once the base case is reached, the function returns the result to the previous call
The previous call then continues executing from where it left off
- Q7. Solve and code the problem of a ball falling from staircase. Each jump can be of 1 step or 2. Find the number of combination of reaching step N
- Ans.
Code to find number of combinations of reaching step N by ball falling from staircase with 1 or 2 steps per jump.
Use dynamic programming to solve the problem
Create an array to store the number of ways to reach each step
Initialize the array with base cases for steps 0, 1, and 2
Use a loop to fill in the array for steps 3 to N
The number of ways to reach step i is the sum of the number of ways to reach step i-1 and i-2
Retu...
- Q8. Puzzle: There is a grid of soldier standing. Soldier ‘A’ is chosen: The tallest men from every column and the shortest among them. Soldier ‘B’ is chosen: The shortest men from every row and the tallest amo...
- Q9. What’s priority queue. How will u make stack and queue with priority queue
- Ans.
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Priority queue is implemented using a heap data structure.
Stack can be implemented using a priority queue by assigning higher priority to the most recently added element.
Queue can be implemented using a priority queue by assigning higher priority to the oldest element.
- Q10. Implement stack using queue
- Ans.
Implementing stack using queue involves using two queues to simulate stack behavior.
Create two queues, q1 and q2.
Push operation: Enqueue the element to q1.
Pop operation: Dequeue all elements from q1 to q2 except the last element. Dequeue and return the last element.
Swap the names of q1 and q2 after each pop operation.
Top operation: Return the last element of q1 without dequeuing it.
isEmpty operation: Check if both q1 a...
- Q11. About myself
- Q12. About my family. I mentioned my dad is my idol, so he asked y. M I more like my dad or my mom.
- Q13. My toughest moment in life and how I overcame it
- Ans.
I lost my job during the pandemic and struggled to find a new one
Applied to multiple job openings daily
Networked with former colleagues and industry professionals
Took online courses to improve skills
Maintained a positive attitude and stayed motivated
Eventually landed a new job in a different industry
- Q14. What had I been if I hadn’t been an engg
- Ans.
I would have pursued a career in music or writing.
I have always had a passion for music and writing.
I have played multiple instruments since childhood.
I have written and published short stories and poetry.
I believe creativity is an important aspect of any profession.
- Q15. What do I value most in life. (A real life example)
- Ans.
I value my relationships with loved ones the most.
Spending quality time with family and friends
Making an effort to stay in touch with long-distance loved ones
Prioritizing important events and milestones in their lives
Being there for them during difficult times
Forgiving and working through conflicts to maintain strong bonds
Interview Preparation Tips
Experience: He went
through my CV and asked me something about making an android app. (Note: I had
mentioned Android a couple of times in CV) I explained him how a basic app is
made with model (XML) and layout (Java). He told me about connector which
connects model to layout. Then he asked the two questions. For second ques, I gave a N square approach (dynamic).
He suggested a greedy approach of Order N. It was fitting most cases so I wrote
the code on greedy approach. Turned out, greedy wasn’t the solution anyway.
Doesn’t matter. (Note: Boss is always right!!!)
Round: Technical Interview
Experience: He went
through my CV and asked me about my dropped grades in 12th.In third question, interesting part was, he said me to answer only if I knew it. I replied that I know but the definition isn’t totally memorized and he said to let it go then. (PS: Learn basic defs)
Tips: Ans to 5) is Fibonacci and 6) is A is taller than B
Round: Technical Interview
Experience: He
went through my CV and asked my if I had done Intern in Amazon or Training.
Followed by, he asked me why I didn’t get a PPO there. He then asked me, which
subject I m more confident with: Algo types or OS types. I chose algo.
Tips: Keep your cool and code with confidence. Reason I am saying this is because, he was the senior most interviewer and somehow, he knew the art to stress test you.
Round: HR Interview
Experience: 1)
Be honest
2)
Sit with open palms
3)
Don’t cross your hands or legs(if legs can be
visible)
4)
Keep some back stories ready. Use any names, use your friends story anything to make it real. It will go a long way because nobody is
going to verify it.
5)
Most imp, Be confident about yourself. If you r not
sure of yourself, you would be useless to the company.
General Tips: Code Daily. Practise. Basics are important in such interviews.
Skill Tips: Do refer the previous question sets. It gives you pretty good idea of what's expected of you.
Skills: Algorithm, Puzzle solving, Technical Knowledge, Soft Skills, Data structures
College Name: IIT DHANBAD
Funny Moments: When in first round, I knew greedy approach isn't right, But I went on with it, because I could hear my dad whispering in my ears from behind, Rule 1: Boss is always Right
Rule 2: In case of doubt, refer Rule 1...
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
It was Technical + Aptitude MCQ round.The technical section consisted if MCQ related to DSA,OS,DBMS.The aptitude section consisted of questions related to basic mathematics.
- Q1.
Candies Distribution Problem Statement
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
- Ans.
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
Create an array to store the minimum candies required for each student.
Iterate through the students' ratings array to determine the minimum candies needed based on the given criteria.
Consider the ratings of adjacent students to decide the number of candies to distribute.
Calculate the total candies req...
(2 Questions)
Round duration - 30 minutes
Round difficulty - Medium
It was a technical interview testing the basic skills of OS and DBMS of candidates along with few project discussions from your CV.
- Q1. Can you write 15 Linux commands along with their functions?
- Ans.
List of 15 Linux commands with their functions
ls - list directory contents
pwd - print working directory
cd - change directory
mkdir - make a new directory
rm - remove files or directories
cp - copy files and directories
mv - move or rename files and directories
grep - search for patterns in files
chmod - change file permissions
ps - display information about running processes
top - display and update sorted information about pr...
- Q2. What are DDL (Data Definition Language) and DML (Data Manipulation Language)?
- Ans.
DDL is used to define the structure of database objects, while DML is used to manipulate data within those objects.
DDL includes commands like CREATE, ALTER, DROP to define database objects like tables, indexes, etc.
DML includes commands like INSERT, UPDATE, DELETE to manipulate data within tables.
Example of DDL: CREATE TABLE employees (id INT, name VARCHAR(50));
Example of DML: INSERT INTO employees VALUES (1, 'John Doe...
Interview Preparation Tips
Tip 1 : Be clear about the concepts of Linux and shell scripting.
Tip 2 : Learn about the basics of Data structures and Algorithm.
Tip 3 : Be prepared to explain your projects mentioned in your CV.
Tip 1 : Use professional Keywords in your resume.
Tip 2 : Don't mention anything you are not confident in.
Skills evaluated in this interview
Member Technical Staff Interview Questions & Answers
VMware Software
Anonymous
posted on 24 Sep 2022
I applied via LinkedIn and was interviewed before Sep 2021. There were 2 interview rounds.
(5 Questions)
- Q1. Question from BST, Stack
- Q2. Multi-threading and concurrency, lock.
- Q3. Interval merge, divider and conquer
- Q4. Project discussion, design discussion
- Q5. Manager discussion for 30 min. This was about work and team.
Interview Preparation Tips
- Operating Systems
- Data Structures
- Algorithms
- System Design
Tell us how to improve this page.
Nutanix Interviews By Designations
- Nutanix Member Technical Staff Interview Questions
- Nutanix Site Reliability Engineer Interview Questions
- Nutanix Sdet Automation Test Engineer Interview Questions
- Nutanix Technical Staff Member 2 Interview Questions
- Nutanix System Requirement Engineer Interview Questions
- Nutanix System Engineer Interview Questions
- Nutanix Technical Staff Member 3 Interview Questions
- Nutanix Mts1 Interview Questions
- Show more
Interview Questions from Similar Companies
|
Member Technical Staff
100
salaries
|  ₹24.2 L/yr - ₹43 L/yr |
|
Technical Staff Member 3
55
salaries
| ₹21 L/yr - ₹48 L/yr |
|
Technical Staff Member 2
53
salaries
| ₹25 L/yr - ₹42.8 L/yr |
|
System Reliability Engineer
48
salaries
| ₹10.3 L/yr - ₹27 L/yr |
|
MTS-4
41
salaries
| ₹26 L/yr - ₹60 L/yr |
Red Hat
24/7 Customer
Thomson Reuters
Oracle Cerner
- Home >
- Interviews >
- Nutanix Interview Questions
