Company interviews / Nutanix
Nutanix interview practice
64 coding questions are known to come up in Nutanix interviews (3 easy, 46 medium, 15 hard), 4 of them in the last six months. The most common topics are Array, Hash Table, String, Dynamic Programming.
64Known questions
4Asked in last 6 months
46Medium
15Hard
Coding questions Nutanix asks
From public company-tagged interview question lists. Most recent and most frequent first.
Easy 3Medium 46Hard 15
- Array38
- Hash Table15
- String14
- Dynamic Programming12
- Depth-First Search12
- Greedy11
- Matrix10
- Breadth-First Search10
- Design7
- Stack7
- Sorting7
- Binary Search7
| Question | Difficulty | Asked recently |
|---|---|---|
| LRU Cache | Medium | Yes |
| Minimum Operations to Halve Array Sum | Medium | Yes |
| Binary Tree Cameras | Hard | Yes |
| Asteroid Collision | Medium | Yes |
| Minimum Processing Time | Medium | — |
| Maximum Sum of an Hourglass | Medium | — |
| Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | — |
| Delivering Boxes from Storage to Ports | Hard | — |
| Detect Cycles in 2D Grid | Medium | — |
| Online Majority Element In Subarray | Hard | — |
| Swap For Longest Repeated Character Substring | Medium | — |
| Grumpy Bookstore Owner | Medium | — |
| Check If Word Is Valid After Substitutions | Medium | — |
| Broken Calculator | Medium | — |
| Car Fleet | Medium | — |
| Convert Binary Number in a Linked List to Integer | Easy | — |
| Merge Intervals | Medium | — |
| Sliding Window Maximum | Hard | — |
| Increasing Triplet Subsequence | Medium | — |
| Valid Number | Hard | — |
| Group Anagrams | Medium | — |
| Best Sightseeing Pair | Medium | — |
| Maximum Frequency Stack | Hard | — |
| Task Scheduler | Medium | — |
| Diameter of Binary Tree | Easy | — |
Practice a Nutanix interview
Take the same AI interview a Nutanix candidate would face: you talk it through while you code, and get a scorecard with what earned each score. Three single-question interviews a day are free.