G

Google

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

Showing 100 of 100 questions

1
100
ArrayHash Table
2
MediumAdd Two Numbersβœ“ Our Solution
75
Linked ListMathRecursion
3
HardTrapping Rain Waterβœ“ Our Solution
74
ArrayTwo PointersDynamic ProgrammingStack+1
4
HardMedian of Two Sorted Arraysβœ“ Our Solution
73
ArrayBinary SearchDivide and Conquer
5
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
70
Hash TableStringSliding Window
6
EasyLongest Common Prefixβœ“ Our Solution
70
StringTrie
7
EasyValid Parenthesesβœ“ Our Solution
67
StringStack
8
MediumLongest Consecutive Sequenceβœ“ Our Solution
66
ArrayHash TableUnion Find
9
MediumMaximum Subarrayβœ“ Our Solution
63
ArrayDivide and ConquerDynamic Programming
10
MediumRotate Imageβœ“ Our Solution
58
ArrayMathMatrix
11
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
58
ArrayBinary Search
12
EasyReverse Linked Listβœ“ Our Solution
57
Linked ListRecursion
13
56
ArrayTwo PointersSorting
14
MediumJump Gameβœ“ Our Solution
56
ArrayDynamic ProgrammingGreedy
15
MediumGroup Anagramsβœ“ Our Solution
55
ArrayHash TableStringSorting
16
HardFind Median from Data Streamβœ“ Our Solution
55
Two PointersDesignSortingHeap (Priority Queue)+1
17
EasyPascal's Triangleβœ“ Our Solution
55
ArrayDynamic Programming
18
EasySingle Numberβœ“ Our Solution
55
ArrayBit Manipulation
19
EasyFind the Index of the First Occurrence in a Stringβœ“ Our Solution
54
Two PointersStringString Matching
20
HardMaximal Rectangleβœ“ Our Solution
54
ArrayDynamic ProgrammingStackMatrix+1
21
EasyValid Anagramβœ“ Our Solution
51
Hash TableStringSorting
22
HardFirst Missing Positiveβœ“ Our Solution
51
ArrayHash Table
23
MediumJump Game IIβœ“ Our Solution
51
ArrayDynamic ProgrammingGreedy
24
EasyAdd Binaryβœ“ Our Solution
50
MathStringBit ManipulationSimulation
25
HardText Justificationβœ“ Our Solution
49
ArrayStringSimulation
26
MediumInsert Intervalβœ“ Our Solution
47
Array
27
MediumMaximum Product Subarrayβœ“ Our Solution
46
ArrayDynamic Programming
28
MediumString to Integer (atoi)βœ“ Our Solution
44
String
29
EasySame Treeβœ“ Our Solution
44
TreeDepth-First SearchBreadth-First SearchBinary Tree
30
MediumSearch a 2D Matrixβœ“ Our Solution
44
ArrayBinary SearchMatrix
31
EasyIsomorphic Stringsβœ“ Our Solution
43
Hash TableString
32
Medium3Sum Closestβœ“ Our Solution
43
ArrayTwo PointersSorting
33
HardWildcard Matchingβœ“ Our Solution
43
StringDynamic ProgrammingGreedyRecursion
34
MediumFind the Duplicate Numberβœ“ Our Solution
43
ArrayTwo PointersBinary SearchBit Manipulation
35
EasyContains Duplicate IIβœ“ Our Solution
42
ArrayHash TableSliding Window
36
EasyMissing Numberβœ“ Our Solution
42
ArrayHash TableMathBinary Search+2
37
EasySymmetric Treeβœ“ Our Solution
42
TreeDepth-First SearchBreadth-First SearchBinary Tree
38
MediumMinimum Path Sumβœ“ Our Solution
41
ArrayDynamic ProgrammingMatrix
39
MediumKth Smallest Element in a BSTβœ“ Our Solution
40
TreeDepth-First SearchBinary Search TreeBinary Tree
40
MediumCopy List with Random Pointerβœ“ Our Solution
39
Hash TableLinked List
41
HardNumber of Islands II
39
ArrayHash TableUnion Find
42
MediumClone Graphβœ“ Our Solution
39
Hash TableDepth-First SearchBreadth-First SearchGraph
43
MediumInteger to Romanβœ“ Our Solution
38
Hash TableMathString
44
HardShortest Palindromeβœ“ Our Solution
38
StringRolling HashString MatchingHash Function
45
MediumFlatten Binary Tree to Linked Listβœ“ Our Solution
37
Linked ListStackTreeDepth-First Search+1
46
MediumGroup Shifted Strings
35
ArrayHash TableString
47
HardWord Search IIβœ“ Our Solution
35
ArrayStringBacktrackingTrie+1
48
MediumBinary Tree Right Side Viewβœ“ Our Solution
35
TreeDepth-First SearchBreadth-First SearchBinary Tree
49
MediumSubsets IIβœ“ Our Solution
35
ArrayBacktrackingBit Manipulation
50
HardThe Skyline Problemβœ“ Our Solution
33
ArrayDivide and ConquerBinary Indexed TreeSegment Tree+3
51
EasyImplement Stack using Queuesβœ“ Our Solution
33
StackDesignQueue
52
MediumBest Time to Buy and Sell Stock with Cooldownβœ“ Our Solution
33
ArrayDynamic Programming
53
EasyMissing Ranges
32
Array
54
MediumGraph Valid Tree
32
Depth-First SearchBreadth-First SearchUnion FindGraph
55
MediumSecond Highest Salaryβœ“ Our Solution
32
Database
56
MediumBasic Calculator IIβœ“ Our Solution
31
MathStringStack
57
MediumGame of Lifeβœ“ Our Solution
31
ArrayMatrixSimulation
58
MediumFraction to Recurring Decimalβœ“ Our Solution
31
Hash TableMathString
59
HardNumber of Digit Oneβœ“ Our Solution
31
MathDynamic ProgrammingRecursion
60
MediumWalls and Gates
30
ArrayBreadth-First SearchMatrix
61
EasyBinary Tree Pathsβœ“ Our Solution
30
StringBacktrackingTreeDepth-First Search+1
62
MediumWiggle Sort
28
ArrayGreedySorting
63
HardBest Time to Buy and Sell Stock IVβœ“ Our Solution
28
ArrayDynamic Programming
64
Medium3Sum Smaller
28
ArrayTwo PointersBinary SearchSorting
65
MediumCombinationsβœ“ Our Solution
26
Backtracking
66
MediumLowest Common Ancestor of a Binary Search Treeβœ“ Our Solution
26
TreeDepth-First SearchBinary Search TreeBinary Tree
67
HardRead N Characters Given read4 II - Call Multiple Times
26
ArraySimulationInteractive
68
MediumPaint Fence
25
Dynamic Programming
69
MediumLongest Substring with At Most Two Distinct Characters
25
Hash TableStringSliding Window
70
EasyFlip Game
25
String
71
EasyBinary Tree Postorder Traversalβœ“ Our Solution
25
StackTreeDepth-First SearchBinary Tree
72
EasyStrobogrammatic Number
25
Hash TableTwo PointersString
73
MediumZigzag Iterator
25
ArrayDesignQueueIterator
74
MediumSpiral Matrix IIβœ“ Our Solution
24
ArrayMatrixSimulation
75
MediumPeeking Iteratorβœ“ Our Solution
24
ArrayDesignIterator
76
HardDepartment Top Three Salariesβœ“ Our Solution
24
Database
77
HardClosest Binary Search Tree Value II
24
Two PointersStackTreeDepth-First Search+3
78
MediumFlatten 2D Vector
24
ArrayTwo PointersDesignIterator
79
MediumUnique Word Abbreviation
22
ArrayHash TableStringDesign
80
MediumFlip Game II
22
MathDynamic ProgrammingBacktrackingMemoization+1
81
EasyPalindrome Permutation
22
Hash TableStringBit Manipulation
82
HardScramble Stringβœ“ Our Solution
21
StringDynamic Programming
83
MediumInsertion Sort Listβœ“ Our Solution
21
Linked ListSorting
84
MediumFactorial Trailing Zeroesβœ“ Our Solution
21
Math
85
MediumRemove Duplicates from Sorted List IIβœ“ Our Solution
21
Linked ListTwo Pointers
86
MediumPopulating Next Right Pointers in Each Nodeβœ“ Our Solution
19
Linked ListTreeDepth-First SearchBreadth-First Search+1
87
EasyWord Patternβœ“ Our Solution
19
Hash TableString
88
HardN-Queens IIβœ“ Our Solution
19
Backtracking
89
EasyMinimum Depth of Binary Treeβœ“ Our Solution
19
TreeDepth-First SearchBreadth-First SearchBinary Tree
90
MediumBitwise AND of Numbers Rangeβœ“ Our Solution
17
Bit Manipulation
91
MediumRank Scoresβœ“ Our Solution
15
Database
92
HardValid Numberβœ“ Our Solution
13
String
93
EasyRead N Characters Given Read4
13
ArraySimulationInteractive
94
MediumGray Codeβœ“ Our Solution
13
MathBacktrackingBit Manipulation
95
HardRemove Invalid Parenthesesβœ“ Our Solution
13
StringBacktrackingBreadth-First Search
96
HardFind Minimum in Rotated Sorted Array IIβœ“ Our Solution
13
ArrayBinary Search
97
MediumFind the Celebrity
10
Two PointersGraphInteractive
98
MediumRange Sum Query - Mutableβœ“ Our Solution
5
ArrayDesignBinary Indexed TreeSegment Tree
99
MediumBinary Tree Level Order Traversal IIβœ“ Our Solution
5
TreeBreadth-First SearchBinary Tree
100
MediumPaint House
5
ArrayDynamic Programming