Nutanix coding interview
questions, leaked.
60 problems reported across recent Nutanix interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Nutanix pulls 77% medium and hard problems, with arrays dominating at 58% of the set. You're walking into a gauntlet built on sliding windows, greedy algorithms, and DFS/BFS on grids. Three easy problems won't save you. The real test is speed on medium problems like "Car Fleet" and "LRU Cache" that chain multiple concepts together. If you freeze mid-OA on a sliding-window variant, StealthCoder runs invisibly and surfaces a working solution in seconds, giving you time to move forward instead of spiraling.
Top problems at Nutanix
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Check If Word Is Valid After Substitutions | MEDIUM | 100.0 | 60% | String · Stack |
| 02 | Grumpy Bookstore Owner | MEDIUM | 97.5 | 64% | Array · Sliding Window |
| 03 | Car Fleet | MEDIUM | 97.5 | 53% | Array · Stack · Sorting |
| 04 | Delivering Boxes from Storage to Ports | HARD | 97.5 | 39% | Array · Dynamic Programming · Segment Tree |
| 05 | Detect Cycles in 2D Grid | MEDIUM | 97.5 | 50% | Array · Depth-First Search · Breadth-First Search |
| 06 | Partitioning Into Minimum Number Of Deci-Binary Numbers | MEDIUM | 97.5 | 89% | String · Greedy |
| 07 | Minimum Processing Time | MEDIUM | 97.5 | 69% | Array · Greedy · Sorting |
| 08 | Maximum Sum of an Hourglass | MEDIUM | 97.5 | 76% | Array · Matrix · Prefix Sum |
| 09 | Online Majority Element In Subarray | HARD | 97.5 | 39% | Array · Binary Search · Design |
| 10 | Swap For Longest Repeated Character Substring | MEDIUM | 97.5 | 44% | Hash Table · String · Sliding Window |
| 11 | Broken Calculator | MEDIUM | 97.5 | 55% | Math · Greedy |
| 12 | LRU Cache | MEDIUM | 83.8 | 45% | Hash Table · Linked List · Design |
| 13 | Pacific Atlantic Water Flow | MEDIUM | 79.0 | 58% | Array · Depth-First Search · Breadth-First Search |
| 14 | Increasing Triplet Subsequence | MEDIUM | 73.0 | 39% | Array · Greedy |
| 15 | Group Anagrams | MEDIUM | 73.0 | 71% | Array · Hash Table · String |
| 16 | Merge Intervals | MEDIUM | 73.0 | 49% | Array · Sorting |
| 17 | Sliding Window Maximum | HARD | 73.0 | 48% | Array · Queue · Sliding Window |
| 18 | Rotting Oranges | MEDIUM | 73.0 | 57% | Array · Breadth-First Search · Matrix |
| 19 | Reverse Linked List II | MEDIUM | 65.4 | 50% | Linked List |
| 20 | Set Matrix Zeroes | MEDIUM | 65.4 | 61% | Array · Hash Table · Matrix |
| 21 | Maximum Frequency Stack | HARD | 65.4 | 66% | Hash Table · Stack · Design |
| 22 | Valid Number | HARD | 65.4 | 22% | String |
| 23 | Boundary of Binary Tree | MEDIUM | 65.4 | 47% | Tree · Depth-First Search · Binary Tree |
| 24 | Spiral Matrix | MEDIUM | 65.4 | 54% | Array · Matrix · Simulation |
| 25 | Decode String | MEDIUM | 65.4 | 61% | String · Stack · Recursion |
| 26 | Search a 2D Matrix | MEDIUM | 65.4 | 52% | Array · Binary Search · Matrix |
| 27 | Two Sum | EASY | 65.4 | 56% | Array · Hash Table |
| 28 | Top K Frequent Elements | MEDIUM | 65.4 | 65% | Array · Hash Table · Divide and Conquer |
| 29 | Product of Array Except Self | MEDIUM | 65.4 | 68% | Array · Prefix Sum |
| 30 | First Missing Positive | HARD | 65.4 | 41% | Array · Hash Table |
| 31 | Clone Graph | MEDIUM | 54.7 | 62% | Hash Table · Depth-First Search · Breadth-First Search |
| 32 | Surrounded Regions | MEDIUM | 54.7 | 43% | Array · Depth-First Search · Breadth-First Search |
| 33 | Trapping Rain Water | HARD | 54.7 | 65% | Array · Two Pointers · Dynamic Programming |
| 34 | Binary Tree Maximum Path Sum | HARD | 54.7 | 41% | Dynamic Programming · Tree · Depth-First Search |
| 35 | Maximum Product of Three Numbers | EASY | 54.7 | 45% | Array · Math · Sorting |
| 36 | Longest Palindromic Substring | MEDIUM | 54.7 | 36% | Two Pointers · String · Dynamic Programming |
| 37 | Amount of Time for Binary Tree to Be Infected | MEDIUM | 54.7 | 64% | Hash Table · Tree · Depth-First Search |
| 38 | Minimum Number of Swaps to Make the String Balanced | MEDIUM | 54.7 | 78% | Two Pointers · String · Stack |
| 39 | Min Cost to Connect All Points | MEDIUM | 54.7 | 69% | Array · Union Find · Graph |
| 40 | 3Sum | MEDIUM | 54.7 | 37% | Array · Two Pointers · Sorting |
| 41 | Word Break | MEDIUM | 54.7 | 48% | Array · Hash Table · String |
| 42 | Container With Most Water | MEDIUM | 54.7 | 58% | Array · Two Pointers · Greedy |
| 43 | Reverse Nodes in k-Group | HARD | 54.7 | 63% | Linked List · Recursion |
| 44 | Best Time to Buy and Sell Stock | EASY | 54.7 | 55% | Array · Dynamic Programming |
| 45 | Add Two Numbers | MEDIUM | 54.7 | 46% | Linked List · Math · Recursion |
| 46 | All Nodes Distance K in Binary Tree | MEDIUM | 54.7 | 66% | Hash Table · Tree · Depth-First Search |
| 47 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | MEDIUM | 54.7 | 57% | Array · Queue · Sliding Window |
| 48 | Heaters | MEDIUM | 54.7 | 40% | Array · Two Pointers · Binary Search |
| 49 | Course Schedule | MEDIUM | 54.7 | 49% | Depth-First Search · Breadth-First Search · Graph |
| 50 | Word Ladder | HARD | 54.7 | 43% | Hash Table · String · Breadth-First Search |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Nutanix OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share.
Get StealthCoder- array35 · 58%
- hash table13 · 22%
- string12 · 20%
- breadth first search11 · 18%
- depth first search10 · 17%
- matrix9 · 15%
- dynamic programming9 · 15%
- sorting9 · 15%
- greedy8 · 13%
- two pointers7 · 12%
Arrays and hash tables form the backbone here, accounting for 80 of 60 problems through overlap. But the trap is thinking you can just "know arrays". Problems like "Delivering Boxes from Storage to Ports" layer dynamic programming, segment trees, and monotonic queues on top of array basics. Depth-first and breadth-first search appear frequently enough that you can't skip graph traversal on grids. Greedy and two-pointers are secondary but show up in unexpected places. Drill sliding windows and monotonic stacks first ("Car Fleet", "Grumpy Bookstore Owner"), then move to DFS/BFS on matrices. The hard problems blend 5-7 topics each, so weak pattern recognition will cost you. StealthCoder becomes your hedge if you encounter a hybrid problem you haven't seen in this exact form.
Companies with similar patterns
If you prepped for Nutanix, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Nutanix.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Nutanix interview FAQ
How many array problems should I solve before Nutanix?+
Target 15-20 solid array problems. Nutanix leans hard on arrays (35 out of 60), but 40% involve sliding windows or monotonic stacks layered on top. Don't just drill basic iteration. Hit problems like "Car Fleet" and "Grumpy Bookstore Owner" that force you to combine multiple array techniques in one pass.
Should I study hash tables before arrays?+
No. Arrays are 58% of Nutanix's set. Master sliding windows and greedy on arrays first ("Grumpy Bookstore Owner", "Minimum Processing Time"), then move to hash tables for string problems like "Group Anagrams" and "Swap For Longest Repeated Character Substring".
Are DFS and BFS essential for Nutanix?+
Yes. Both appear in 10-11 problems, often on matrices and grids. "Detect Cycles in 2D Grid" and "Pacific Atlantic Water Flow" are common enough to show up in your OA. Budget real time for matrix traversal drills.
How much dynamic programming is on the Nutanix assessment?+
Nine problems involve DP, but most are medium difficulty. The hard problems like "Delivering Boxes from Storage to Ports" layer DP with segment trees and monotonic queues. If DP isn't your strong suit, focus on the sliding-window mediums first, then come back to DP-heavy ones.
Is greedy enough of a topic to drill before this OA?+
Greedy appears in 8 problems, often paired with arrays or sorting. "Broken Calculator" and "Minimum Processing Time" are pure greedy. It's worth 30 minutes of drill, but don't spend a day on it. Prioritize arrays, hash tables, and graph traversal first.