N

Nutanix

60 questions tracked58 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 60 of 60 questions

1
MediumCheck If Word Is Valid After Substitutionsβœ“ Our Solution
100
StringStack
2
MediumPartitioning Into Minimum Number Of Deci-Binary Numbersβœ“ Our Solution
98
StringGreedy
3
MediumGrumpy Bookstore Ownerβœ“ Our Solution
98
ArraySliding Window
4
HardDelivering Boxes from Storage to Portsβœ“ Our Solution
98
ArrayDynamic ProgrammingSegment TreeQueue+3
5
MediumBroken Calculatorβœ“ Our Solution
98
MathGreedy
6
MediumDetect Cycles in 2D Gridβœ“ Our Solution
98
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
7
MediumMaximum Sum of an Hourglassβœ“ Our Solution
98
ArrayMatrixPrefix Sum
8
HardOnline Majority Element In Subarrayβœ“ Our Solution
98
ArrayBinary SearchDesignBinary Indexed Tree+1
9
MediumSwap For Longest Repeated Character Substringβœ“ Our Solution
98
Hash TableStringSliding Window
10
MediumCar Fleetβœ“ Our Solution
98
ArrayStackSortingMonotonic Stack
11
MediumMinimum Processing Timeβœ“ Our Solution
98
ArrayGreedySorting
12
MediumLRU Cacheβœ“ Our Solution
84
Hash TableLinked ListDesignDoubly-Linked List
13
MediumPacific Atlantic Water Flowβœ“ Our Solution
79
ArrayDepth-First SearchBreadth-First SearchMatrix
14
MediumIncreasing Triplet Subsequenceβœ“ Our Solution
73
ArrayGreedy
15
MediumGroup Anagramsβœ“ Our Solution
73
ArrayHash TableStringSorting
16
HardSliding Window Maximumβœ“ Our Solution
73
ArrayQueueSliding WindowHeap (Priority Queue)+1
17
MediumRotting Orangesβœ“ Our Solution
73
ArrayBreadth-First SearchMatrix
18
MediumMerge Intervalsβœ“ Our Solution
73
ArraySorting
19
MediumProduct of Array Except Selfβœ“ Our Solution
65
ArrayPrefix Sum
20
MediumTop K Frequent Elementsβœ“ Our Solution
65
ArrayHash TableDivide and ConquerSorting+4
21
HardValid Numberβœ“ Our Solution
65
String
22
MediumDecode Stringβœ“ Our Solution
65
StringStackRecursion
23
MediumSearch a 2D Matrixβœ“ Our Solution
65
ArrayBinary SearchMatrix
24
HardMaximum Frequency Stackβœ“ Our Solution
65
Hash TableStackDesignOrdered Set
25
MediumSpiral Matrixβœ“ Our Solution
65
ArrayMatrixSimulation
26
65
ArrayHash Table
27
MediumReverse Linked List IIβœ“ Our Solution
65
Linked List
28
MediumBoundary of Binary Tree
65
TreeDepth-First SearchBinary Tree
29
HardFirst Missing Positiveβœ“ Our Solution
65
ArrayHash Table
30
MediumSet Matrix Zeroesβœ“ Our Solution
65
ArrayHash TableMatrix
31
MediumMeeting Rooms II
55
ArrayTwo PointersGreedySorting+2
32
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
55
ArrayBinary Search
33
MediumAmount of Time for Binary Tree to Be Infectedβœ“ Our Solution
55
Hash TableTreeDepth-First SearchBreadth-First Search+1
34
MediumClone Graphβœ“ Our Solution
55
Hash TableDepth-First SearchBreadth-First SearchGraph
35
MediumSurrounded Regionsβœ“ Our Solution
55
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
36
MediumLongest Palindromic Subsequenceβœ“ Our Solution
55
StringDynamic Programming
37
HardMerge k Sorted Listsβœ“ Our Solution
55
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
38
HardBinary Tree Maximum Path Sumβœ“ Our Solution
55
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
39
MediumSwap Nodes in Pairsβœ“ Our Solution
55
Linked ListRecursion
40
MediumLongest Common Subsequenceβœ“ Our Solution
55
StringDynamic Programming
41
MediumMinimum Number of Swaps to Make the String Balancedβœ“ Our Solution
55
Two PointersStringStackGreedy
42
MediumFind Minimum in Rotated Sorted Arrayβœ“ Our Solution
55
ArrayBinary Search
43
MediumAll Nodes Distance K in Binary Treeβœ“ Our Solution
55
Hash TableTreeDepth-First SearchBreadth-First Search+1
44
MediumLongest Palindromic Substringβœ“ Our Solution
55
Two PointersStringDynamic Programming
45
MediumContainer With Most Waterβœ“ Our Solution
55
ArrayTwo PointersGreedy
46
MediumJump Game IIβœ“ Our Solution
55
ArrayDynamic ProgrammingGreedy
47
HardWord Ladderβœ“ Our Solution
55
Hash TableStringBreadth-First Search
48
MediumCourse Scheduleβœ“ Our Solution
55
Depth-First SearchBreadth-First SearchGraphTopological Sort
49
MediumHeatersβœ“ Our Solution
55
ArrayTwo PointersBinary SearchSorting
50
MediumLongest Continuous Subarray With Absolute Diff Less Than or Equal to Limitβœ“ Our Solution
55
ArrayQueueSliding WindowHeap (Priority Queue)+2
51
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
55
ArrayDynamic Programming
52
MediumNumber of Islandsβœ“ Our Solution
55
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
53
EasyMaximum Product of Three Numbersβœ“ Our Solution
55
ArrayMathSorting
54
MediumAdd Two Numbersβœ“ Our Solution
55
Linked ListMathRecursion
55
HardReverse Nodes in k-Groupβœ“ Our Solution
55
Linked ListRecursion
56
MediumMin Cost to Connect All Pointsβœ“ Our Solution
55
ArrayUnion FindGraphMinimum Spanning Tree
57
55
ArrayTwo PointersSorting
58
MediumWord Breakβœ“ Our Solution
55
ArrayHash TableStringDynamic Programming+2
59
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
55
TreeBreadth-First SearchBinary Tree
60
HardTrapping Rain Waterβœ“ Our Solution
55
ArrayTwo PointersDynamic ProgrammingStack+1