N

Nvidia

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

Showing 100 of 100 questions

1
EasyLast Stone Weightβœ“ Our Solution
100
ArrayHeap (Priority Queue)
2
MediumLRU Cacheβœ“ Our Solution
90
Hash TableLinked ListDesignDoubly-Linked List
3
MediumGroup Anagramsβœ“ Our Solution
87
ArrayHash TableStringSorting
4
MediumMinimum Operations to Reduce an Integer to 0βœ“ Our Solution
85
Dynamic ProgrammingGreedyBit Manipulation
5
HardSpecial Binary Stringβœ“ Our Solution
84
StringRecursion
6
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
82
ArrayDynamic Programming
7
80
ArrayHash Table
8
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
80
Hash TableStringSliding Window
9
MediumAdd Two Numbersβœ“ Our Solution
78
Linked ListMathRecursion
10
MediumMaximum Subarrayβœ“ Our Solution
78
ArrayDivide and ConquerDynamic Programming
11
MediumNumber of Islandsβœ“ Our Solution
78
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
12
HardMaximum Number of Visible Pointsβœ“ Our Solution
76
ArrayMathGeometrySliding Window+1
13
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
76
ArrayBinary Search
14
EasyReverse Bitsβœ“ Our Solution
76
Divide and ConquerBit Manipulation
15
MediumDot Product of Two Sparse Vectors
71
ArrayHash TableTwo PointersDesign
16
EasyValid Parenthesesβœ“ Our Solution
71
StringStack
17
EasyMissing Numberβœ“ Our Solution
71
ArrayHash TableMathBinary Search+2
18
HardMerge k Sorted Listsβœ“ Our Solution
67
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
19
MediumMerge Intervalsβœ“ Our Solution
67
ArraySorting
20
EasyMove Zeroesβœ“ Our Solution
67
ArrayTwo Pointers
21
MediumTask Scheduler IIβœ“ Our Solution
67
ArrayHash TableSimulation
22
EasyFibonacci Numberβœ“ Our Solution
64
MathDynamic ProgrammingRecursionMemoization
23
MediumCopy List with Random Pointerβœ“ Our Solution
64
Hash TableLinked List
24
HardFind Median from Data Streamβœ“ Our Solution
64
Two PointersDesignSortingHeap (Priority Queue)+1
25
MediumRotate Imageβœ“ Our Solution
64
ArrayMathMatrix
26
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
60
ArrayHash TableMathDesign+1
27
MediumRectangle Areaβœ“ Our Solution
60
MathGeometry
28
MediumString to Integer (atoi)βœ“ Our Solution
60
String
29
MediumGenerate Parenthesesβœ“ Our Solution
60
StringDynamic ProgrammingBacktracking
30
HardTrapping Rain Waterβœ“ Our Solution
60
ArrayTwo PointersDynamic ProgrammingStack+1
31
MediumFind the Duplicate Numberβœ“ Our Solution
60
ArrayTwo PointersBinary SearchBit Manipulation
32
EasyClimbing Stairsβœ“ Our Solution
60
MathDynamic ProgrammingMemoization
33
MediumBreak a Palindromeβœ“ Our Solution
60
StringGreedy
34
MediumKth Largest Element in an Arrayβœ“ Our Solution
60
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
35
HardBinary Tree Maximum Path Sumβœ“ Our Solution
54
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
36
MediumSnapshot Arrayβœ“ Our Solution
54
ArrayHash TableBinary SearchDesign
37
HardDelete Duplicate Folders in Systemβœ“ Our Solution
54
ArrayHash TableStringTrie+1
38
MediumSpiral Matrixβœ“ Our Solution
54
ArrayMatrixSimulation
39
HardSliding Puzzleβœ“ Our Solution
54
ArrayDynamic ProgrammingBacktrackingBreadth-First Search+2
40
MediumH-Indexβœ“ Our Solution
54
ArraySortingCounting Sort
41
MediumSingle Element in a Sorted Arrayβœ“ Our Solution
54
ArrayBinary Search
42
MediumMaximal Squareβœ“ Our Solution
54
ArrayDynamic ProgrammingMatrix
43
MediumReverse Linked List IIβœ“ Our Solution
54
Linked List
44
MediumValidate Binary Search Treeβœ“ Our Solution
54
TreeDepth-First SearchBinary Search TreeBinary Tree
45
EasyIntersection of Two Linked Listsβœ“ Our Solution
54
Hash TableLinked ListTwo Pointers
46
EasyLongest Common Prefixβœ“ Our Solution
48
StringTrie
47
MediumWays to Make a Fair Arrayβœ“ Our Solution
48
ArrayPrefix Sum
48
MediumFind Peak Elementβœ“ Our Solution
48
ArrayBinary Search
49
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
48
Hash TableStringDesignTrie
50
MediumDouble a Number Represented as a Linked Listβœ“ Our Solution
48
Linked ListMathStack
51
MediumMinimum Add to Make Parentheses Validβœ“ Our Solution
48
StringStackGreedy
52
MediumMaximum Sum of Distinct Subarrays With Length Kβœ“ Our Solution
48
ArrayHash TableSliding Window
53
HardMax Points on a Lineβœ“ Our Solution
48
ArrayHash TableMathGeometry
54
EasyReverse Linked Listβœ“ Our Solution
48
Linked ListRecursion
55
MediumConvert Binary Search Tree to Sorted Doubly Linked List
48
Linked ListStackTreeDepth-First Search+3
56
EasyMajority Elementβœ“ Our Solution
48
ArrayHash TableDivide and ConquerSorting+1
57
HardSerialize and Deserialize Binary Treeβœ“ Our Solution
48
StringTreeDepth-First SearchBreadth-First Search+2
58
MediumMinimum Size Subarray Sumβœ“ Our Solution
48
ArrayBinary SearchSliding WindowPrefix Sum
59
EasyMerge Sorted Arrayβœ“ Our Solution
48
ArrayTwo PointersSorting
60
MediumReverse Integerβœ“ Our Solution
48
Math
61
MediumCourse Schedule IIβœ“ Our Solution
48
Depth-First SearchBreadth-First SearchGraphTopological Sort
62
MediumKeys and Roomsβœ“ Our Solution
48
Depth-First SearchBreadth-First SearchGraph
63
MediumMinimum Knight Moves
48
Breadth-First Search
64
EasyFind Pivot Indexβœ“ Our Solution
48
ArrayPrefix Sum
65
EasyDesign HashMapβœ“ Our Solution
48
ArrayHash TableLinked ListDesign+1
66
EasyCounting Bitsβœ“ Our Solution
48
Dynamic ProgrammingBit Manipulation
67
HardBest Time to Buy and Sell Stock IVβœ“ Our Solution
48
ArrayDynamic Programming
68
MediumHouse Robberβœ“ Our Solution
48
ArrayDynamic Programming
69
MediumFind The Original Array of Prefix Xorβœ“ Our Solution
48
ArrayBit Manipulation
70
EasyIntersection of Two Arraysβœ“ Our Solution
48
ArrayHash TableTwo PointersBinary Search+1
71
MediumShuffle an Arrayβœ“ Our Solution
48
ArrayMathDesignRandomized
72
MediumVerify Preorder Sequence in Binary Search Tree
48
ArrayStackTreeBinary Search Tree+3
73
MediumLinked List Random Nodeβœ“ Our Solution
48
Linked ListMathReservoir SamplingRandomized
74
MediumSet Matrix Zeroesβœ“ Our Solution
48
ArrayHash TableMatrix
75
EasyRemove Duplicates from Sorted Listβœ“ Our Solution
38
Linked List
76
MediumCoin Changeβœ“ Our Solution
38
ArrayDynamic ProgrammingBreadth-First Search
77
MediumCourse Scheduleβœ“ Our Solution
38
Depth-First SearchBreadth-First SearchGraphTopological Sort
78
EasyPrint in Orderβœ“ Our Solution
38
Concurrency
79
MediumRange Sum Query 2D - Immutableβœ“ Our Solution
38
ArrayDesignMatrixPrefix Sum
80
EasyFizz Buzzβœ“ Our Solution
38
MathStringSimulation
81
MediumMeeting Rooms II
38
ArrayTwo PointersGreedySorting+2
82
MediumDelete Node in a Linked Listβœ“ Our Solution
38
Linked List
83
MediumValidate IP Addressβœ“ Our Solution
38
String
84
EasyGreatest Common Divisor of Stringsβœ“ Our Solution
38
MathString
85
MediumRobot Bounded In Circleβœ“ Our Solution
38
MathStringSimulation
86
MediumValid Sudokuβœ“ Our Solution
38
ArrayHash TableMatrix
87
HardLongest Increasing Path in a Matrixβœ“ Our Solution
38
ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4
88
MediumMaximum Product Subarrayβœ“ Our Solution
38
ArrayDynamic Programming
89
MediumSubarray Product Less Than Kβœ“ Our Solution
38
ArrayBinary SearchSliding WindowPrefix Sum
90
MediumMin Stackβœ“ Our Solution
38
StackDesign
91
38
ArrayTwo PointersSorting
92
EasyIs Subsequenceβœ“ Our Solution
38
Two PointersStringDynamic Programming
93
MediumRemove Nth Node From End of Listβœ“ Our Solution
38
Linked ListTwo Pointers
94
MediumNumber of Operations to Make Network Connectedβœ“ Our Solution
38
Depth-First SearchBreadth-First SearchUnion FindGraph
95
MediumAll Possible Full Binary Treesβœ“ Our Solution
38
Dynamic ProgrammingTreeRecursionMemoization+1
96
EasyRectangle Overlapβœ“ Our Solution
38
MathGeometry
97
MediumSort Characters By Frequencyβœ“ Our Solution
38
Hash TableStringSortingHeap (Priority Queue)+2
98
MediumSwapping Nodes in a Linked Listβœ“ Our Solution
38
Linked ListTwo Pointers
99
EasySingle Numberβœ“ Our Solution
38
ArrayBit Manipulation
100
MediumCount the Number of Good Subsequences
38
Hash TableMathStringCombinatorics+1