DSA Doctor
Verified Company Vault
Nutanix DSA Interview Questions
65 curated coding interview questions directly asked in Nutanix technical rounds, sorted by frequency with recency and difficulty diagnostics.
65
Total Questions
3 (5%)
Easy Problems
44 (68%)
Medium Problems
18 (28%)
Hard Problems
🔥 Most Tested Topics:
Arrays (23)Core DSA (13)Trees (10)Strings (10)Linked List (5)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 968 | Binary Tree Cameras | Hard | Trees | DFS / BFS | 47.9% | 100.0% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | 3m |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy | Linked List | Two Pointers | 82.4% | 100.0% | 6m |
| 991 | Broken Calculator | Medium | Stack / Queue | Monotonic Stack / Simulation | 56.1% | 100.0% | all |
| 1003 | Check If Word Is Valid After Substitutions | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 61.2% | 100.0% | all |
| 2895 | Minimum Processing Time | Medium | Arrays | Sorting / Prefix / Scan | 70.3% | 100.0% | all |
| 1052 | Grumpy Bookstore Owner | Medium | Core DSA | Implementation / Reasoning | 64.0% | 100.0% | all |
| 1156 | Swap For Longest Repeated Character Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 44.5% | 100.0% | all |
| 1157 | Online Majority Element In Subarray | Hard | Arrays | Sorting / Prefix / Scan | 40.4% | 100.0% | all |
| 2428 | Maximum Sum of an Hourglass | Medium | Arrays | Sorting / Prefix / Scan | 76.3% | 100.0% | all |
| 1559 | Detect Cycles in 2D Grid | Medium | Linked List | Two Pointers | 63.3% | 100.0% | all |
| 1687 | Delivering Boxes from Storage to Ports | Hard | Core DSA | Implementation / Reasoning | 39.8% | 100.0% | all |
| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 90.5% | 100.0% | all |
| 853 | Car Fleet | Medium | Core DSA | Implementation / Reasoning | 55.1% | 100.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 87.5% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 75.0% | 6m |
| 543 | Diameter of Binary Tree | Easy | Trees | DFS / BFS | 65.5% | 75.0% | 6m |
| 605 | Can Place Flowers | Easy | Core DSA | Implementation / Reasoning | 29.1% | 75.0% | 6m |
| 1823 | Find the Winner of the Circular Game | Medium | Core DSA | Implementation / Reasoning | 82.2% | 75.0% | 6m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 75.0% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 75.0% | all |
| 65 | Valid Number | Hard | Strings | Hashing / Sliding Window | 23.0% | 75.0% | all |
| 334 | Increasing Triplet Subsequence | Medium | Core DSA | Implementation / Reasoning | 39.4% | 75.0% | all |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 62.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 62.5% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 62.5% | all |
| 895 | Maximum Frequency Stack | Hard | Arrays; Stack / Queue | Sorting / Prefix / Scan; Monotonic Stack / Simulation | 66.8% | 62.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 62.5% | all |
| 74 | Search a 2D Matrix | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 53.9% | 62.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | all |
| 92 | Reverse Linked List II | Medium | Linked List | Two Pointers | 51.5% | 62.5% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 62.5% | all |
| 329 | Longest Increasing Path in a Matrix | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 56.6% | 62.5% | all |
| 1014 | Best Sightseeing Pair | Medium | Core DSA | Implementation / Reasoning | 62.7% | 62.5% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 62.5% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 50.0% | all |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 50.0% | all |
| 417 | Pacific Atlantic Water Flow | Medium | Core DSA | Implementation / Reasoning | 61.0% | 50.0% | all |
| 545 | Boundary of Binary Tree | Medium | Trees | DFS / BFS | 48.1% | 50.0% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 50.0% | all |
| 1584 | Min Cost to Connect All Points | Medium | Core DSA | Implementation / Reasoning | 70.9% | 50.0% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 50.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 50.0% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 50.0% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 50.0% | all |
| 133 | Clone Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.3% | 50.0% | all |
| 130 | Surrounded Regions | Medium | Core DSA | Implementation / Reasoning | 45.3% | 50.0% | all |
| 516 | Longest Palindromic Subsequence | Medium | Core DSA | Implementation / Reasoning | 65.4% | 50.0% | all |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 50.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | all |
| 189 | Rotate Array | Medium | Arrays | Sorting / Prefix / Scan | 44.9% | 50.0% | all |
| 2712 | Minimum Cost to Make All Characters Equal | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 54.4% | 50.0% | all |
| 716 | Max Stack | Hard | Stack / Queue | Monotonic Stack / Simulation | 45.9% | 50.0% | all |
| 2127 | Maximum Employees to Be Invited to a Meeting | Hard | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 61.8% | 50.0% | all |
| 132 | Palindrome Partitioning II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 37.1% | 50.0% | all |
| 1146 | Snapshot Array | Medium | Arrays | Sorting / Prefix / Scan | 36.8% | 50.0% | all |
| 1631 | Path With Minimum Effort | Medium | Arrays | Sorting / Prefix / Scan | 63.2% | 50.0% | all |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 50.0% | all |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 50.0% | all |
| 126 | Word Ladder II | Hard | Strings | Hashing / Sliding Window | 27.7% | 50.0% | all |
| 2074 | Reverse Nodes in Even Length Groups | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 64.1% | 50.0% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 50.0% | all |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 50.0% | all |