Nutanix Coding Interview Questions
We track 67 coding questions asked at Nutanix, tagged with the algorithms and concepts they test. The most common: Array, Hash Table, Depth-First Search, Dynamic Programming, String.
Browse all 67 Nutanix questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array17.5%
- String8.1%
- Hash Table6.6%
- Linked List5.9%
- Dynamic Programming5.8%
- Greedy5.3%
- Depth-First Search4.4%
- Matrix4.4%
- Breadth-First Search3.7%
- Sorting3.1%
- Other (31)35.5%
How many questions involve each concept
Share of all 67 tracked Nutanix questions that touch each concept. Questions usually involve several, so these overlap.
- Array56.7%
- Hash Table22.4%
- Depth-First Search19.4%
- Dynamic Programming19.4%
- String19.4%
- Breadth-First Search16.4%
- Matrix16.4%
- Greedy13.4%
- Binary Search10.4%
- Linked List10.4%
- Sorting10.4%
- Design9.0%
Where Nutanix differs from the average company
Concept weight at Nutanix relative to the average across all companies we track. Green means Nutanix leans on it harder than most.
- Monotonic Queue5.0×
- Topological Sort3.0×
- Linked List2.8×
- Doubly-Linked List2.7×
- Math0.52×
- Counting0.50×
- Simulation0.47×
- Two Pointers0.39×
Nutanix specialties
Concepts that show up at Nutanix but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 67 tracked Nutanix questions.
- Junior6% (4)
- Mid/Senior67% (45)
- Staff27% (18)
Every concept in Nutanix interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 38 | 56.7% | 17.5% |
| Hash Table | 15 | 22.4% | 6.6% |
| Depth-First Search | 13 | 19.4% | 4.4% |
| Dynamic Programming | 13 | 19.4% | 5.8% |
| String | 13 | 19.4% | 8.1% |
| Breadth-First Search | 11 | 16.4% | 3.7% |
| Matrix | 11 | 16.4% | 4.4% |
| Greedy | 9 | 13.4% | 5.3% |
| Binary Search | 7 | 10.4% | 2.9% |
| Linked List | 7 | 10.4% | 5.9% |
| Sorting | 7 | 10.4% | 3.1% |
| Design | 6 | 9.0% | 2.1% |
| Heap (Priority Queue) | 6 | 9.0% | 1.6% |
| Binary Tree | 5 | 7.5% | 2.1% |
| Graph Theory | 5 | 7.5% | 1.7% |
| Math | 5 | 7.5% | 2.9% |
| Sliding Window | 5 | 7.5% | 2.5% |
| Stack | 5 | 7.5% | 2.4% |
| Tree | 5 | 7.5% | 2.1% |
| Union-Find | 5 | 7.5% | 1.6% |
| Prefix Sum | 4 | 6.0% | 1.4% |
| Queue | 3 | 4.5% | 0.8% |
| Recursion | 3 | 4.5% | 1.6% |
| Topological Sort | 3 | 4.5% | 0.9% |
| Two Pointers | 3 | 4.5% | 1.4% |
| Counting | 2 | 3.0% | 0.5% |
| Divide and Conquer | 2 | 3.0% | 0.6% |
| Doubly-Linked List | 2 | 3.0% | 0.8% |
| Memoization | 2 | 3.0% | 0.5% |
| Monotonic Queue | 2 | 3.0% | 0.5% |
| Monotonic Stack | 2 | 3.0% | 0.7% |
| Segment Tree | 2 | 3.0% | 0.5% |
| Simulation | 2 | 3.0% | 0.8% |
| Backtracking | 1 | 1.5% | 0.4% |
| Binary Indexed Tree | 1 | 1.5% | 0.3% |
| Bucket Sort | 1 | 1.5% | 0.2% |
| Merge Sort | 1 | 1.5% | 0.4% |
| Minimum Spanning Tree | 1 | 1.5% | 0.4% |
| Ordered Set | 1 | 1.5% | 0.4% |
| Quickselect | 1 | 1.5% | 0.2% |
| Trie | 1 | 1.5% | 0.3% |
Practice a Nutanix interview
Take a realistic AI-led mock interview with questions Nutanix actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required