AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Clear (1)
Nutanix SDE Interview Questions and Answers
Nutanix SDE Interview Experiences
1 interview found
Anonymous
30 mins
3 questions
medium level
easy to answer
(2 Questions)
- Q1. SDLC robot framework related selenium basics
- Q2. Test methodologies
Rate your
company
🤫 100% anonymous
How was your last interview experience?
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
6 Questions
- Q1. Find a equilibrium index in array
- Ans.
Find an index in array where sum of elements on left side is equal to sum of elements on right side.
Loop through array and calculate sum of all elements
Then loop through array again and check if sum of elements on left side is equal to sum of elements on right side
Return the index if found, else return -1
- Q2. Find the minimum no of jumps required to reach the end of array.where element at each index represent how many max moves you will take in right
- Ans.
Find minimum number of jumps required to reach end of array with max moves in right direction at each index.
Use dynamic programming approach to solve the problem
Maintain an array to store minimum number of jumps required to reach each index
Traverse the array and update the minimum number of jumps for each index
Return the minimum number of jumps required to reach the end of array
- Q3. Tournament tree puzzle and write code for that
- Ans.
Tournament tree is a binary tree where each node represents a match between two players/teams.
Tournament tree is used in sports tournaments to determine the winner.
The leaf nodes represent the players/teams and the internal nodes represent the matches.
The winner of each match is the node with the higher score.
Code can be written using a recursive function to traverse the tree and determine the winner.
- Q4. Find the 2 maximum elements in array in O(n+log(n)) comparison
- Ans.
Find 2 maximum elements in array in O(n+log(n)) comparison
Use divide and conquer approach
Divide array into two halves
Recursively find max elements in each half
Compare the two max elements to find the overall max elements
- Q5. Celebrity Problem puzzle and write code for that
- Q6. Given a 2D array of 0 and 1. where each row is sorted. find the row with maximum no of 1 in minimum time complexcity
- Ans.
Find row with maximum 1s in a sorted 2D array of 0s and 1s.
Use binary search to find the first occurrence of 1 in each row.
Calculate the number of 1s in each row using the index found in step 1.
Keep track of the row with maximum number of 1s.
Time complexity: O(m log n), where m is the number of rows and n is the number of columns.
Interview Preparation Tips
Skills evaluated in this interview
Interview Questionnaire
8 Questions
- Q1. Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?
- Ans.
Efficiently check if a number is present in an array where each element differs by 1.
Use binary search to find the element in the array
Calculate the difference between the middle element and the first element
If the difference is equal to the index of the middle element minus the index of the first element, then the left half of the array is consecutive
If the difference is not equal, then the right half of the array is ...
- Q2. Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5
- Ans.
Microsoft Excel
Add more chart types (p1)
Improve collaboration features (p2)
Enhance data analysis tools (p3)
Integrate with more external data sources (p4)
Improve error handling and debugging (p5)
- Q3. A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square
- Ans.
Program to rearrange shuffled 16 squares to get original big square
Create a 4x4 matrix to represent the big square and fill it with shuffled squares
Loop through the matrix and check if each square is in the correct position
If a square is not in the correct position, swap it with the square in the correct position
Repeat until all squares are in the correct position
- Q4. There are 9 identical Marbels out of which 1 is heavy. find out that Marbel
- Q5. Given 3 sorted arrays, array a, b, c. find all pairs where a[i] + b[j] = c[k] note : a, b , c are sorted arrays
- Q6. What is the difference between the two declarations? int p=*(int*)i; int p=*(int*)&i;
- Ans.
The first declaration casts i to int pointer and dereferences it, while the second declaration casts the address of i to int pointer and dereferences it.
The first declaration assumes i is already an int pointer.
The second declaration takes the address of i and casts it to an int pointer.
The first declaration may cause a segmentation fault if i is not an int pointer.
The second declaration may cause unexpected behavior i...
- Q7. Given an unsorted array of size 5. How many minimum comparisons are needed to find the median? then he extended it for size n
- Ans.
Minimum comparisons needed to find median in unsorted array of size n
For odd n, median is the middle element. For even n, median is the average of middle two elements
Minimum comparisons needed for odd n is (n-1)/2. For even n, it is n/2
Various sorting algorithms can be used to find median in an unsorted array
- Q8. Given an array which is alternatively sorted. What will be the time complexity to find out an element in it. e.g. 14,3,16,6,22,7,24,11,27
- Ans.
Time complexity to find an element in an alternatively sorted array.
The time complexity will be O(log n) using binary search.
Check the middle element and compare with the target element.
If the middle element is greater than the target, search in the left half of the array.
If the middle element is smaller than the target, search in the right half of the array.
Repeat until the target element is found or the array is exha
Interview Preparation Tips
Experience: #Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?
#Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5.
#A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.
#There are 9 identical Marbels out of which 1 is heavy. find out that Marbel.
#given 3 sorted arrays, array a, b, c.
find all pairs where a[i] + b[j] = c[k]
note : a, b , c are sorted arrays.
#What is the difference between the two declarations?
int p=*(int*)i;
int p=*(int*)&i;
#Given an unsorted array of size 5.
How many minimum comparisons are needed to find the median? then he extended it for size n.
#Given an array which is alternatively sorted. What will be the time complexity to find out an element in it.
e.g. 14,3,16,6,22,7,24,11,27
College Name: NA
Skills evaluated in this interview
Easy to medium test was easily solvable
Quantitative and Verbal
2 Questions - DSA (Array and Numbers)
(1 Question)
- Q1. Projects mentioned in the resume and technical skills
Selected
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
Aptitude and technical questions
2 coding questions with choice of language
(2 Questions)
- Q1. Technical questions
- Q2. Programming questions
I applied via Campus Placement and was interviewed in Jul 2022. There were 2 interview rounds.
Cs subjects regarding OS, C, DBMS
(2 Questions)
- Q1. Implement insertion sort
- Ans.
Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.
Start with the second element and compare it with the first element, swap if necessary
Move to the third element and compare it with the second and first element, swap if necessary
Continue this process until the entire array is sorted
Time complexity: O(n^2)
Example: ['banana', 'apple', 'orange', 'grape'] -> ['apple', 'banan
- Q2. Implement tree and code
- Ans.
Implementing a tree data structure using code
Define a Node class with left and right child pointers
Implement insert, search, and delete functions
Traversal methods: inorder, preorder, postorder
Examples: binary search tree, AVL tree, red-black tree
Interview Preparation Tips
- DBMS
- C
- CPP
- OS
Skills evaluated in this interview
I was interviewed before May 2021.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
- Q1. What are functional relations in the context of database management systems (DBMS)?
- Ans.
Functional relations in DBMS define a relationship between input and output values where each input has a unique output.
Functional relations ensure that each input value maps to only one output value.
They are commonly used in database design to enforce data integrity and consistency.
For example, in a table storing employee information, the employee ID can be a functional key that uniquely identifies each employee.
(1 Question)
Round duration - 40 minutes
Round difficulty - Hard
- Q1. Puzzle
Questions related to Web development and machine learning
- Ans.
The question is related to Web development and machine learning.
Web development involves creating websites and web applications using languages like HTML, CSS, and JavaScript.
Machine learning is a subset of artificial intelligence that involves building models to make predictions based on data.
Examples of web development frameworks include React, Angular, and Vue.js.
Examples of machine learning algorithms include linea...
Round duration - 20 minutes
Round difficulty - Medium
Interview Preparation Tips
Tip 1 : Have clear understanding of fundamental concepts.
Tip 2 : Have a skill of explaining your thoughts as clearly as possible.
Tip 3 : Practice RDBMS and OS concepts.
Tip 1 : Mention about the projects you've done with detail
Tip 2 : Have deep knowledge about everything mentioned on your resume.
Skills evaluated in this interview
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
(1 Question)
- Q1. 2 string based coding questions RXJS and js based input output questions
Lakshay Dabas
(2 Questions)
- Q1. Traverse Binary Tree
- Ans.
Traverse a binary tree in different orders (inorder, preorder, postorder)
Inorder traversal: Left, Root, Right
Preorder traversal: Root, Left, Right
Postorder traversal: Left, Right, Root
- Q2. How does bittorent work
- Ans.
BitTorrent is a peer-to-peer file sharing protocol that allows users to distribute large amounts of data over the internet.
BitTorrent breaks down files into small pieces and distributes them among multiple users.
Users download and upload pieces of the file simultaneously, increasing download speeds.
Users connect to a tracker to find other users sharing the same file.
Popular BitTorrent clients include uTorrent, BitTorre
Nutanix Interview FAQs
Recently Viewed
PHOTOS
InsuranceDekho
3 office photos
LIST OF COMPANIES
Credit Bajaar
Overview
DESIGNATION
LIST OF COMPANIES
ClearTrail Technologies
Overview
SALARIES
Indo Autotech
SALARIES
Balkrishna Industries
No Salaries
COMPANY BENEFITS
Balkrishna Industries
No Benefits
REVIEWS
ClearTrail Technologies
No Reviews
LIST OF COMPANIES
Balkrishna Industries
Overview
DESIGNATION
Tell us how to improve this page.
Nutanix Interviews By Designations
- Nutanix Member Technical Staff Interview Questions
- Nutanix Site Reliability Engineer Interview Questions
- Nutanix Technical Staff Member 2 Interview Questions
- Nutanix System Requirement Engineer Interview Questions
- Nutanix System Engineer Interview Questions
- Nutanix Sdet Automation Test Engineer Interview Questions
- Nutanix Technical Staff Member 3 Interview Questions
- Nutanix Mts1 Interview Questions
- Show more
Interview Questions for Popular Designations
- Acquisition Manager Interview Questions
- Production Incharge Interview Questions
- Broadcast Assistant Interview Questions
- Accounts Payable Specialist Interview Questions
- Delivery Partner Interview Questions
- Corporate Relationship Officer Interview Questions
- Junior Content Writer Interview Questions
- Electronics and Electrical Engineer Interview Questions
- Show more
Nutanix SDE Interview Process
based on 1 interview
Interview experience
Sopra Steria
Success to our employee's well-being? A work-life balance that's simply unbeatable.
SDE Interview Questions from Similar Companies
Fast track your campus placements
|
Member Technical Staff
101
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
System Reliability Engineer
46
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Mts1
35
salaries
| ₹0 L/yr - ₹0 L/yr |
|
MTS-4
35
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Technical Staff Member 3
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Red Hat
VMware Software
Cisco
Dell
- Home >
- Interviews >
- Nutanix Interview Questions >
- Nutanix SDE Interview Questions
