Nutanix Interview Questions — 60 DSA Problems 58 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Nutanix LeetCode questions for software engineering interviews.
Check If Word Is Valid After Substitutions (MEDIUM) — String, Stack Partitioning Into Minimum Number Of Deci-Binary Numbers (MEDIUM) — String, Greedy Grumpy Bookstore Owner (MEDIUM) — Array, Sliding Window Delivering Boxes from Storage to Ports (HARD) — Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue Broken Calculator (MEDIUM) — Math, Greedy Detect Cycles in 2D Grid (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix Maximum Sum of an Hourglass (MEDIUM) — Array, Matrix, Prefix Sum Online Majority Element In Subarray (HARD) — Array, Binary Search, Design, Binary Indexed Tree, Segment Tree Swap For Longest Repeated Character Substring (MEDIUM) — Hash Table, String, Sliding Window Car Fleet (MEDIUM) — Array, Stack, Sorting, Monotonic Stack Minimum Processing Time (MEDIUM) — Array, Greedy, Sorting LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List Pacific Atlantic Water Flow (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Matrix Increasing Triplet Subsequence (MEDIUM) — Array, Greedy Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix Merge Intervals (MEDIUM) — Array, Sorting Product of Array Except Self (MEDIUM) — Array, Prefix Sum Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect Valid Number (HARD) — String Decode String (MEDIUM) — String, Stack, Recursion Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix Maximum Frequency Stack (HARD) — Hash Table, Stack, Design, Ordered Set Spiral Matrix (MEDIUM) — Array, Matrix, Simulation Two Sum (EASY) — Array, Hash Table Reverse Linked List II (MEDIUM) — Linked List Boundary of Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree First Missing Positive (HARD) — Array, Hash Table Set Matrix Zeroes (MEDIUM) — Array, Hash Table, Matrix Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search Amount of Time for Binary Tree to Be Infected (MEDIUM) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Clone Graph (MEDIUM) — Hash Table, Depth-First Search, Breadth-First Search, Graph Surrounded Regions (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix Longest Palindromic Subsequence (MEDIUM) — String, Dynamic Programming Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree Swap Nodes in Pairs (MEDIUM) — Linked List, Recursion Longest Common Subsequence (MEDIUM) — String, Dynamic Programming Minimum Number of Swaps to Make the String Balanced (MEDIUM) — Two Pointers, String, Stack, Greedy Find Minimum in Rotated Sorted Array (MEDIUM) — Array, Binary Search All Nodes Distance K in Binary Tree (MEDIUM) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy Jump Game II (MEDIUM) — Array, Dynamic Programming, Greedy Word Ladder (HARD) — Hash Table, String, Breadth-First Search Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort Heaters (MEDIUM) — Array, Two Pointers, Binary Search, Sorting Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit (MEDIUM) — Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue N
Nutanix 60 questions tracked 58 with solutions
📊 All Time 60 📅 Last 6 Months 16 🔥 Last 3 Months 6 ⚡ Last 30 Days 0
Sorted highest → lowest frequency ✓ Our Solution = we have a detailed walkthrough
Showing 60 of 60 questions
2 Medium Partitioning Into Minimum Number Of Deci-Binary Numbers ✓ Our Solution String Greedy
4 Array Dynamic Programming Segment Tree Queue +3
6 Array Depth-First Search Breadth-First Search Union Find +1
8 Array Binary Search Design Binary Indexed Tree +1
9 Hash Table String Sliding Window
10 Array Stack Sorting Monotonic Stack
12 Hash Table Linked List Design Doubly-Linked List
13 Array Depth-First Search Breadth-First Search Matrix
15 Array Hash Table String Sorting
16 Array Queue Sliding Window Heap (Priority Queue) +1
17 Array Breadth-First Search Matrix
20 Array Hash Table Divide and Conquer Sorting +4
24 Hash Table Stack Design Ordered Set
28 Medium Boundary of Binary Tree
Tree Depth-First Search Binary Tree
31 Medium Meeting Rooms II
Array Two Pointers Greedy Sorting +2
33 Hash Table Tree Depth-First Search Breadth-First Search +1
34 Hash Table Depth-First Search Breadth-First Search Graph
35 Array Depth-First Search Breadth-First Search Union Find +1
36 String Dynamic Programming
37 Linked List Divide and Conquer Heap (Priority Queue) Merge Sort
38 Dynamic Programming Tree Depth-First Search Binary Tree
40 String Dynamic Programming
41 Medium Minimum Number of Swaps to Make the String Balanced ✓ Our Solution Two Pointers String Stack Greedy
43 Hash Table Tree Depth-First Search Breadth-First Search +1
44 Two Pointers String Dynamic Programming
46 Array Dynamic Programming Greedy
47 Hash Table String Breadth-First Search
48 Depth-First Search Breadth-First Search Graph Topological Sort
49 Array Two Pointers Binary Search Sorting
50 Medium Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit ✓ Our Solution Array Queue Sliding Window Heap (Priority Queue) +2
52 Array Depth-First Search Breadth-First Search Union Find +1
56 Array Union Find Graph Minimum Spanning Tree
58 Array Hash Table String Dynamic Programming +2
59 Tree Breadth-First Search Binary Tree
60 Array Two Pointers Dynamic Programming Stack +1
