Sign In
Back to Sheets/Nutanix Master DSA Sheet

Nutanix Master DSA Sheet

This compilation contains exclusive, previously asked data structure and algorithm questions from real Nutanix interviews. Focus on these core problem patterns to confidently tackle even the hardest interview challenges.

top-specificnutanix-prep
0
68
Minimum Processing Time
Medium
Course Schedule II6 Months
Medium
Delivering Boxes from Storage to Ports
Hard
Maximum Sum of an Hourglass
Medium
Spiral Matrix
Medium
Online Majority Element In Subarray
Hard
Check If Word Is Valid After Substitutions
Medium
Jump Game II
Medium
Swap For Longest Repeated Character Substring
Medium
Word Ladder II
Hard
Snapshot Array
Medium
Meeting Rooms II
Medium
Max Stack
Hard
Partitioning Into Minimum Number Of Deci-Binary Numbers
Medium
Best Sightseeing Pair
Medium
Grumpy Bookstore Owner
Medium
Pacific Atlantic Water Flow
Medium
Merge Intervals6 Months
Medium
Trapping Rain Water
Hard
Split Array Largest Sum6 Months
Hard
Serialize and Deserialize Binary Tree
Hard
Longest Substring Without Repeating Characters
Medium
Product of Array Except Self
Medium
Diameter of Binary Tree3 Months
Easy
All Nodes Distance K in Binary Tree
Medium
Clone Graph
Medium
Reverse Nodes in Even Length Groups
Medium
Task Scheduler
Medium
First Missing Positive
Hard
Convert Binary Number in a Linked List to Integer3 Months
Easy
Rotate Image3 Months
Medium
Palindrome Partitioning II
Hard
Longest Increasing Path in a Matrix
Hard
LFU Cache
Hard
Valid Number
Hard
Two Sum
Easy
Search in Rotated Sorted Array
Medium
Path With Minimum Effort
Medium
Detect Cycles in 2D Grid
Medium
Broken Calculator
Medium
Set Matrix Zeroes
Medium
Decode String
Medium
LRU Cache
Medium
Number of Islands
Medium
Max Consecutive Ones III
Medium
Binary Tree Maximum Path Sum
Hard
Top K Frequent Elements
Medium
Group Anagrams
Medium
Minimum Cost to Make All Characters Equal
Medium
Rotate Array
Medium
Merge k Sorted Lists
Hard
3Sum
Medium
Sliding Window Maximum6 Months
Hard
Word Break
Medium
Boundary of Binary Tree
Medium
Maximum Product of Three Numbers
Easy
Can Place Flowers3 Months
Easy
Car Fleet
Medium
Binary Tree Zigzag Level Order Traversal
Medium
Reverse Linked List II
Medium
Longest Palindromic Subsequence
Medium
Min Cost to Connect All Points
Medium
Surrounded Regions
Medium
Swap Nodes in Pairs
Medium
Maximum Frequency Stack
Hard
Increasing Triplet Subsequence
Medium
Search a 2D Matrix
Medium
Maximum Employees to Be Invited to a Meeting
Hard