Nutanix LeetCode interview questions

Explore Nutanix questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 70

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Broken Calculator Math Greedy MEDIUM	Medium	100.0%	0.6%
Check If Word Is Valid After Substitutions String Stack MEDIUM	Medium	100.0%	0.6%
Minimum Processing Time Array Greedy Sorting MEDIUM	Medium	100.0%	0.7%
Grumpy Bookstore Owner Array Sliding Window MEDIUM	Medium	100.0%	0.6%
LRU Cache Hash Table Linked List Design +1 MEDIUM	Medium	100.0%	0.5%
Swap For Longest Repeated Character Substring Hash Table String Sliding Window MEDIUM	Medium	100.0%	0.5%
Online Majority Element In Subarray Array Binary Search Design +4 HARD	Hard	100.0%	0.4%
Maximum Sum of an Hourglass Array Matrix Prefix Sum MEDIUM	Medium	100.0%	0.8%
Detect Cycles in 2D Grid Array Depth-First Search Breadth-First Search +2 MEDIUM	Medium	100.0%	0.6%
Delivering Boxes from Storage to Ports Array Dynamic Programming Segment Tree +4 HARD	Hard	100.0%	0.4%
Partitioning Into Minimum Number Of Deci-Binary Numbers String Greedy MEDIUM	Medium	100.0%	0.9%
Car Fleet Array Stack Sorting +1 MEDIUM	Medium	100.0%	0.6%
Convert Binary Number in a Linked List to Integer Linked List Math EASY	Easy	100.0%	0.8%
Weighted Sum of a Tree Array Tree Depth-First Search MEDIUM	Medium	100.0%	0.4%
Sliding Window Maximum Array Queue Sliding Window +3 HARD	Hard	96.1%	0.5%
Merge Intervals Array Sorting Quicksort MEDIUM	Medium	96.1%	0.5%
Group Anagrams Array Hash Table String +1 MEDIUM	Medium	79.7%	0.7%
Valid Number String HARD	Hard	79.7%	0.2%
Increasing Triplet Subsequence Array Greedy Longest Increasing Subsequence MEDIUM	Medium	79.7%	0.4%
Binary Tree Zigzag Level Order Traversal Tree Breadth-First Search Binary Tree MEDIUM	Medium	71.3%	0.6%

Showing 1–20 of 70 matching problems · All Problems

Nutanix LeetCode Interview Questions | Grind Practice