Nutanix LeetCode Interview Questions
Practice 67 coding problems currently tagged to Nutanix. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
Top Topics at Nutanix
Focused field guides
Prepare beyond the problem list
Ace your Nutanix interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Nutanix Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Broken Calculator 100% | MediumM | Solve→ |
Check If Word Is Valid After Substitutions 100% | MediumM | Solve→ |
Minimum Processing Time 100% | MediumM | Solve→ |
Grumpy Bookstore Owner 100% | MediumM | Solve→ |
Swap For Longest Repeated Character Substring 100% | MediumM | Solve→ |
Online Majority Element In Subarray 100% | HardH | Solve→ |
Maximum Sum of an Hourglass 100% | MediumM | Solve→ |
Detect Cycles in 2D Grid 100% | MediumM | Solve→ |
Delivering Boxes from Storage to Ports 100% | HardH | Solve→ |
Partitioning Into Minimum Number Of Deci-Binary Numbers 100% | MediumM | Solve→ |
Car Fleet 100% | MediumM | Solve→ |
LRU Cache 96.1% | MediumM | Solve→ |
Merge Intervals 96.1% | MediumM | Solve→ |
Convert Binary Number in a Linked List to Integer 96.1% | EasyE | Solve→ |
Sliding Window Maximum 86.3% | HardH | Solve→ |
Group Anagrams 79.8% | MediumM | Solve→ |
Valid Number 79.8% | HardH | Solve→ |
Increasing Triplet Subsequence 79.8% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 71.5% | MediumM | Solve→ |
Spiral Matrix 71.5% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 71.5% | HardH | Solve→ |
Maximum Frequency Stack 71.5% | HardH | Solve→ |
Decode String 71.5% | MediumM | Solve→ |
Search a 2D Matrix 71.5% | MediumM | Solve→ |
Reverse Linked List II 71.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Serialize and Deserialize Binary Tree 71.5% | HardH | Solve→ |
Max Stack 71.5% | HardH | Solve→ |
Longest Increasing Path in a Matrix 71.5% | HardH | Solve→ |
Best Sightseeing Pair 71.5% | MediumM | Solve→ |
Task Scheduler 71.5% | MediumM | Solve→ |
Course Schedule II 71.5% | MediumM | Solve→ |
Rotate Image 71.5% | MediumM | Solve→ |
Diameter of Binary Tree 71.5% | EasyE | Solve→ |
Longest Substring Without Repeating Characters 71.5% | MediumM | Solve→ |
First Missing Positive 59.8% | HardH | Solve→ |
Jump Game II 59.8% | MediumM | Solve→ |
Pacific Atlantic Water Flow 59.8% | MediumM | Solve→ |
Boundary of Binary Tree 59.8% | MediumM | Solve→ |
Top K Frequent Elements 59.8% | MediumM | Solve→ |
Min Cost to Connect All Points 59.8% | MediumM | Solve→ |
Word Break 59.8% | MediumM | Solve→ |
Meeting Rooms II 59.8% | MediumM | Solve→ |
Search in Rotated Sorted Array 59.8% | MediumM | Solve→ |
Clone Graph 59.8% | MediumM | Solve→ |
Surrounded Regions 59.8% | MediumM | Solve→ |
Longest Palindromic Subsequence 59.8% | MediumM | Solve→ |
Set Matrix Zeroes 59.8% | MediumM | Solve→ |
Trapping Rain Water 59.8% | HardH | Solve→ |
Rotate Array 59.8% | MediumM | Solve→ |
Minimum Cost to Make All Characters Equal 59.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Employees to Be Invited to a Meeting 59.8% | HardH | Solve→ |
Snapshot Array 59.8% | MediumM | Solve→ |
Path With Minimum Effort 59.8% | MediumM | Solve→ |
Split Array Largest Sum 59.8% | HardH | Solve→ |
Max Consecutive Ones III 59.8% | MediumM | Solve→ |
Word Ladder II 59.8% | HardH | Solve→ |
Reverse Nodes in Even Length Groups 59.8% | MediumM | Solve→ |
3Sum 59.8% | MediumM | Solve→ |
Can Place Flowers 59.8% | EasyE | Solve→ |
LFU Cache 59.8% | HardH | Solve→ |
Binary Tree Cameras 59.8% | HardH | Solve→ |
Find the Winner of the Circular Game 59.8% | MediumM | Solve→ |
Asteroid Collision 59.8% | MediumM | Solve→ |
Implement Trie (Prefix Tree) 59.8% | MediumM | Solve→ |
Minimum Operations to Halve Array Sum 59.8% | MediumM | Solve→ |
House Robber II 59.8% | MediumM | Solve→ |
Remove Duplicate Letters 59.8% | MediumM | Solve→ |
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Nutanix?
Our current Nutanix practice dataset contains 67 tagged coding problems, including Broken Calculator, Check If Word Is Valid After Substitutions, Minimum Processing Time. The difficulty breakdown is 3 Easy, 48 Medium, and 16 Hard problems.
How should I prepare for a Nutanix coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Nutanix interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Nutanix coding interviews?
Based on our data, Nutanix interviews include 3 Easy (4%), 48 Medium (72%), and 16 Hard (24%) problems.
Ready to ace your Nutanix interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required