Nutanix LeetCode Questions
65 questions all-time · 3 easy · 44 medium · 18 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Broken Calculator Math, Greedy | Medium | 100 | 0.6% |
| 2 | Check If Word Is Valid After Substitutions String, Stack | Medium | 100 | 0.6% |
| 3 | Minimum Processing Time Array, Greedy, Sorting | Medium | 100 | 0.7% |
| 4 | Grumpy Bookstore Owner Array, Sliding Window | Medium | 100 | 0.6% |
| 5 | Swap For Longest Repeated Character Substring Hash Table, String, Sliding Window | Medium | 100 | 0.4% |
| 6 | Online Majority Element In Subarray Array, Binary Search, Design, Binary Indexed Tree, Segment Tree | Hard | 100 | 0.4% |
| 7 | Maximum Sum of an Hourglass Array, Matrix, Prefix Sum | Medium | 100 | 0.8% |
| 8 | Detect Cycles in 2D Grid Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 100 | 0.6% |
| 9 | Delivering Boxes from Storage to Ports Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue | Hard | 100 | 0.4% |
| 10 | Partitioning Into Minimum Number Of Deci-Binary Numbers String, Greedy | Medium | 100 | 0.9% |
| 11 | Car Fleet Array, Stack, Sorting, Monotonic Stack | Medium | 100 | 0.6% |
| 12 | Merge Intervals Array, Sorting | Medium | 90 | 0.5% |
| 13 | Convert Binary Number in a Linked List to Integer Linked List, Math | Easy | 90 | 0.8% |
| 14 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 86 | 0.5% |
| 15 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 81 | 0.5% |
| 16 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 75 | 0.7% |
| 17 | Valid Number String | Hard | 75 | 0.2% |
| 18 | Increasing Triplet Subsequence Array, Greedy | Medium | 75 | 0.4% |
| 19 | Rotate Image Array, Math, Matrix | Medium | 75 | 0.8% |
| 20 | Binary Tree Zigzag Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 67 | 0.6% |
| 21 | Spiral Matrix Array, Matrix, Simulation | Medium | 67 | 0.6% |
| 22 | Binary Tree Maximum Path Sum Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 67 | 0.4% |
| 23 | Maximum Frequency Stack Hash Table, Stack, Design, Ordered Set | Hard | 67 | 0.7% |
| 24 | Decode String String, Stack, Recursion | Medium | 67 | 0.6% |
| 25 | Search a 2D Matrix Array, Binary Search, Matrix | Medium | 67 | 0.5% |
| 26 | Search in Rotated Sorted Array Array, Binary Search | Medium | 67 | 0.5% |
| 27 | Reverse Linked List II Linked List | Medium | 67 | 0.5% |
| 28 | Serialize and Deserialize Binary Tree String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree | Hard | 67 | 0.6% |
| 29 | Max Stack Linked List, Stack, Design, Doubly-Linked List, Ordered Set | Hard | 67 | 0.5% |
| 30 | Longest Increasing Path in a Matrix Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix | Hard | 67 | 0.6% |
| 31 | Best Sightseeing Pair Array, Dynamic Programming | Medium | 67 | 0.6% |
| 32 | Task Scheduler Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 67 | 0.6% |
| 33 | Course Schedule II Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 67 | 0.6% |
| 34 | Diameter of Binary Tree Tree, Depth-First Search, Binary Tree | Easy | 67 | 0.7% |
| 35 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 67 | 0.4% |
| 36 | First Missing Positive Array, Hash Table | Hard | 56 | 0.4% |
| 37 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 56 | 0.4% |
| 38 | Pacific Atlantic Water Flow Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 56 | 0.6% |
| 39 | Boundary of Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 56 | 0.5% |
| 40 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 56 | 0.7% |
| 41 | Min Cost to Connect All Points Array, Union-Find, Graph Theory, Minimum Spanning Tree | Medium | 56 | 0.7% |
| 42 | Word Break Array, Hash Table, String, Dynamic Programming, Trie, Memoization | Medium | 56 | 0.5% |
| 43 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 56 | 0.6% |
| 44 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 56 | 0.6% |
| 45 | Meeting Rooms II Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 56 | 0.5% |
| 46 | Clone Graph Hash Table, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 56 | 0.7% |
| 47 | Surrounded Regions Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 56 | 0.5% |
| 48 | Longest Palindromic Subsequence String, Dynamic Programming | Medium | 56 | 0.7% |
| 49 | Set Matrix Zeroes Array, Hash Table, Matrix | Medium | 56 | 0.6% |
| 50 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 56 | 0.7% |
| 51 | Rotate Array Array, Math, Two Pointers | Medium | 56 | 0.5% |
| 52 | Minimum Cost to Make All Characters Equal String, Dynamic Programming, Greedy | Medium | 56 | 0.5% |
| 53 | Maximum Employees to Be Invited to a Meeting Array, Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort | Hard | 56 | 0.6% |
| 54 | Palindrome Partitioning II String, Dynamic Programming | Hard | 56 | 0.4% |
| 55 | Snapshot Array Array, Hash Table, Binary Search, Design | Medium | 56 | 0.4% |
| 56 | Path With Minimum Effort Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix | Medium | 56 | 0.6% |
| 57 | Split Array Largest Sum Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum | Hard | 56 | 0.6% |
| 58 | Max Consecutive Ones III Array, Binary Search, Sliding Window, Prefix Sum | Medium | 56 | 0.7% |
| 59 | Word Ladder II Hash Table, String, Backtracking, Breadth-First Search | Hard | 56 | 0.3% |
| 60 | Reverse Nodes in Even Length Groups Linked List | Medium | 56 | 0.6% |
| 61 | 3Sum Array, Two Pointers, Sorting | Medium | 56 | 0.4% |
| 62 | Can Place Flowers Array, Greedy | Easy | 56 | 0.3% |
| 63 | LFU Cache Hash Table, Linked List, Design, Doubly-Linked List | Hard | 56 | 0.5% |
| 64 | Binary Tree Cameras Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 56 | 0.5% |
| 65 | Find the Winner of the Circular Game Array, Math, Recursion, Queue, Simulation | Medium | 56 | 0.8% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.