Nutanix
70 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Rotate Array | Medium | 59.5% | TopicsArrayMathTwo Pointers |
| 2127. Maximum Employees to Be Invited to a Meeting | Hard | 59.5% | TopicsArrayDynamic ProgrammingDepth-First SearchGraph TheoryTopological SortKosaraju's AlgorithmTarjan's SCC Algorithm |
| 1146. Snapshot Array | Medium | 59.5% | TopicsArrayHash TableBinary SearchDesignPersistent Data Structure |
| 1631. Path With Minimum Effort | Medium | 59.5% | TopicsArrayBinary SearchDepth-First SearchBreadth-First SearchUnion-FindHeap (Priority Queue)MatrixDijkstra's Algorithm |
| Split Array Largest Sum | Hard | 59.5% | TopicsArrayBinary SearchDynamic ProgrammingGreedyPrefix Sum |
| 1004. Max Consecutive Ones III | Medium | 59.5% | TopicsArrayBinary SearchSliding WindowPrefix Sum |
| Word Ladder II | Hard | 59.5% | TopicsHash TableStringBacktrackingBreadth-First SearchBidirectional Search |
| 2074. Reverse Nodes in Even Length Groups | Medium | 59.5% | TopicsLinked List |
| 605. Can Place Flowers | Easy | 59.5% | TopicsArrayGreedy |
| LFU Cache | Hard | 59.5% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 968. Binary Tree Cameras | Hard | 59.5% | TopicsDynamic ProgrammingTreeDepth-First SearchBinary TreeDP on Trees |
| 1823. Find the Winner of the Circular Game | Medium | 59.5% | TopicsArrayMathRecursionQueueSimulation |
| Asteroid Collision | Medium | 59.5% | TopicsArrayStackSimulation |
| Implement Trie (Prefix Tree) | Medium | 59.5% | TopicsHash TableStringDesignTrie |
| 2208. Minimum Operations to Halve Array Sum | Medium | 59.5% | TopicsArrayGreedyHeap (Priority Queue) |
| 213. House Robber II | Medium | 59.5% | TopicsArrayDynamic Programming |
| Remove Duplicate Letters | Medium | 59.5% | TopicsStringStackGreedyMonotonic Stack |
| 200. Number of Islands | Medium | 59.5% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 2402. Meeting Rooms III | Hard | 59.5% | TopicsArrayHash TableSortingHeap (Priority Queue)Simulation |
| 2065. Maximum Path Quality of a Graph | Hard | 59.5% | TopicsArrayBacktrackingGraph Theory |
