N
Nutanix
60 questions tracked58 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 60 of 60 questions
4ArrayDynamic ProgrammingSegment TreeQueue+3
6ArrayDepth-First SearchBreadth-First SearchUnion Find+1
8ArrayBinary SearchDesignBinary Indexed Tree+1
9Hash TableStringSliding Window
10ArrayStackSortingMonotonic Stack
12Hash TableLinked ListDesignDoubly-Linked List
13ArrayDepth-First SearchBreadth-First SearchMatrix
15ArrayHash TableStringSorting
16ArrayQueueSliding WindowHeap (Priority Queue)+1
17ArrayBreadth-First SearchMatrix
20ArrayHash TableDivide and ConquerSorting+4
24Hash TableStackDesignOrdered Set
28MediumBoundary of Binary Tree
TreeDepth-First SearchBinary Tree
31MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
33Hash TableTreeDepth-First SearchBreadth-First Search+1
34Hash TableDepth-First SearchBreadth-First SearchGraph
35ArrayDepth-First SearchBreadth-First SearchUnion Find+1
36StringDynamic Programming
37Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
38Dynamic ProgrammingTreeDepth-First SearchBinary Tree
40StringDynamic Programming
41Two PointersStringStackGreedy
43Hash TableTreeDepth-First SearchBreadth-First Search+1
44Two PointersStringDynamic Programming
46ArrayDynamic ProgrammingGreedy
47Hash TableStringBreadth-First Search
48Depth-First SearchBreadth-First SearchGraphTopological Sort
49ArrayTwo PointersBinary SearchSorting
50MediumLongest Continuous Subarray With Absolute Diff Less Than or Equal to Limitβ Our Solution ArrayQueueSliding WindowHeap (Priority Queue)+2
52ArrayDepth-First SearchBreadth-First SearchUnion Find+1
56ArrayUnion FindGraphMinimum Spanning Tree
58ArrayHash TableStringDynamic Programming+2
59TreeBreadth-First SearchBinary Tree
60ArrayTwo PointersDynamic ProgrammingStack+1