N
Nvidia
100 questions tracked94 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
1ArrayHeap (Priority Queue)
2Hash TableLinked ListDesignDoubly-Linked List
3ArrayHash TableStringSorting
4Dynamic ProgrammingGreedyBit Manipulation
8Hash TableStringSliding Window
10ArrayDivide and ConquerDynamic Programming
11ArrayDepth-First SearchBreadth-First SearchUnion Find+1
12ArrayMathGeometrySliding Window+1
14Divide and ConquerBit Manipulation
15MediumDot Product of Two Sparse Vectors
ArrayHash TableTwo PointersDesign
17ArrayHash TableMathBinary Search+2
18Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
21ArrayHash TableSimulation
22MathDynamic ProgrammingRecursionMemoization
24Two PointersDesignSortingHeap (Priority Queue)+1
26ArrayHash TableMathDesign+1
29StringDynamic ProgrammingBacktracking
30ArrayTwo PointersDynamic ProgrammingStack+1
31ArrayTwo PointersBinary SearchBit Manipulation
32MathDynamic ProgrammingMemoization
34ArrayDivide and ConquerSortingHeap (Priority Queue)+1
35Dynamic ProgrammingTreeDepth-First SearchBinary Tree
36ArrayHash TableBinary SearchDesign
37ArrayHash TableStringTrie+1
39ArrayDynamic ProgrammingBacktrackingBreadth-First Search+2
40ArraySortingCounting Sort
42ArrayDynamic ProgrammingMatrix
44TreeDepth-First SearchBinary Search TreeBinary Tree
45Hash TableLinked ListTwo Pointers
49Hash TableStringDesignTrie
52ArrayHash TableSliding Window
53ArrayHash TableMathGeometry
55MediumConvert Binary Search Tree to Sorted Doubly Linked List
Linked ListStackTreeDepth-First Search+3
56ArrayHash TableDivide and ConquerSorting+1
57StringTreeDepth-First SearchBreadth-First Search+2
58ArrayBinary SearchSliding WindowPrefix Sum
61Depth-First SearchBreadth-First SearchGraphTopological Sort
62Depth-First SearchBreadth-First SearchGraph
63MediumMinimum Knight Moves
Breadth-First Search
65ArrayHash TableLinked ListDesign+1
66Dynamic ProgrammingBit Manipulation
70ArrayHash TableTwo PointersBinary Search+1
71ArrayMathDesignRandomized
72MediumVerify Preorder Sequence in Binary Search Tree
ArrayStackTreeBinary Search Tree+3
73Linked ListMathReservoir SamplingRandomized
76ArrayDynamic ProgrammingBreadth-First Search
77Depth-First SearchBreadth-First SearchGraphTopological Sort
79ArrayDesignMatrixPrefix Sum
81MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2
87ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4
89ArrayBinary SearchSliding WindowPrefix Sum
92Two PointersStringDynamic Programming
94Depth-First SearchBreadth-First SearchUnion FindGraph
95Dynamic ProgrammingTreeRecursionMemoization+1
97Hash TableStringSortingHeap (Priority Queue)+2
100MediumCount the Number of Good Subsequences
Hash TableMathStringCombinatorics+1