S

Snap

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

Showing 100 of 100 questions

1
MediumLRU Cacheβœ“ Our Solution
100
Hash TableLinked ListDesignDoubly-Linked List
2
HardMinimum Window Substringβœ“ Our Solution
96
Hash TableStringSliding Window
3
MediumMeeting Rooms II
94
ArrayTwo PointersGreedySorting+2
4
HardWord Ladderβœ“ Our Solution
94
Hash TableStringBreadth-First Search
5
MediumCourse Schedule IIβœ“ Our Solution
89
Depth-First SearchBreadth-First SearchGraphTopological Sort
6
HardMaking A Large Islandβœ“ Our Solution
89
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
7
HardWord Break IIβœ“ Our Solution
89
ArrayHash TableStringDynamic Programming+3
8
MediumDesign Log Storage System
89
Hash TableStringDesignOrdered Set
9
MediumNumber of Islandsβœ“ Our Solution
87
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
10
MediumValid Sudokuβœ“ Our Solution
85
ArrayHash TableMatrix
11
MediumNumber of Distinct Islands
85
Hash TableDepth-First SearchBreadth-First SearchUnion Find+1
12
MediumOne Edit Distance
85
Two PointersString
13
MediumMin Stackβœ“ Our Solution
85
StackDesign
14
HardBus Routesβœ“ Our Solution
85
ArrayHash TableBreadth-First Search
15
HardAlien Dictionary
85
ArrayStringDepth-First SearchBreadth-First Search+2
16
HardBurst Balloonsβœ“ Our Solution
83
ArrayDynamic Programming
17
EasyClosest Binary Search Tree Value
83
Binary SearchTreeDepth-First SearchBinary Search Tree+1
18
MediumGame of Lifeβœ“ Our Solution
83
ArrayMatrixSimulation
19
HardBricks Falling When Hitβœ“ Our Solution
83
ArrayUnion FindMatrix
20
EasyPower of Twoβœ“ Our Solution
83
MathBit ManipulationRecursion
21
HardLeast Operators to Express Numberβœ“ Our Solution
83
MathDynamic ProgrammingMemoization
22
MediumCombination Sum IVβœ“ Our Solution
83
ArrayDynamic Programming
23
MediumLargest Merge Of Two Stringsβœ“ Our Solution
83
Two PointersStringGreedy
24
HardFrog Jumpβœ“ Our Solution
83
ArrayDynamic Programming
25
MediumTernary Expression Parser
83
StringStackRecursion
26
MediumString Compressionβœ“ Our Solution
83
Two PointersString
27
HardWord Abbreviation
83
ArrayStringGreedyTrie+1
28
MediumBinary Tree Vertical Order Traversal
83
Hash TableTreeDepth-First SearchBreadth-First Search+2
29
MediumRemove K Digitsβœ“ Our Solution
83
StringStackGreedyMonotonic Stack
30
MediumCombination Sum IIβœ“ Our Solution
83
ArrayBacktracking
31
EasyReverse Linked Listβœ“ Our Solution
83
Linked ListRecursion
32
HardWildcard Matchingβœ“ Our Solution
83
StringDynamic ProgrammingGreedyRecursion
33
MediumReverse Words in a Stringβœ“ Our Solution
83
Two PointersString
34
HardSudoku Solverβœ“ Our Solution
83
ArrayHash TableBacktrackingMatrix
35
MediumCombination Sumβœ“ Our Solution
83
ArrayBacktracking
36
MediumUnique Binary Search Treesβœ“ Our Solution
83
MathDynamic ProgrammingTreeBinary Search Tree+1
37
MediumBasic Calculator IIβœ“ Our Solution
77
MathStringStack
38
MediumWord Searchβœ“ Our Solution
70
ArrayStringBacktrackingDepth-First Search+1
39
MediumCheapest Flights Within K Stopsβœ“ Our Solution
70
Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraph+2
40
HardShortest Path in a Grid with Obstacles Eliminationβœ“ Our Solution
70
ArrayBreadth-First SearchMatrix
41
MediumDecode Waysβœ“ Our Solution
65
StringDynamic Programming
42
HardValid Arrangement of Pairsβœ“ Our Solution
65
Depth-First SearchGraphEulerian Circuit
43
HardBest Time to Buy and Sell Stock IIIβœ“ Our Solution
65
ArrayDynamic Programming
44
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
60
ArrayHash TableMathDesign+1
45
MediumEvaluate Divisionβœ“ Our Solution
60
ArrayStringDepth-First SearchBreadth-First Search+3
46
MediumMerge Intervalsβœ“ Our Solution
60
ArraySorting
47
MediumScore of Parenthesesβœ“ Our Solution
60
StringStack
48
MediumAmount of Time for Binary Tree to Be Infectedβœ“ Our Solution
60
Hash TableTreeDepth-First SearchBreadth-First Search+1
49
HardDesign a Text Editorβœ“ Our Solution
60
Linked ListStringStackDesign+2
50
HardParallel Courses IIIβœ“ Our Solution
60
ArrayDynamic ProgrammingGraphTopological Sort
51
HardNumber of Islands II
60
ArrayHash TableUnion Find
52
MediumMinimum Number of Keypresses
60
Hash TableStringGreedySorting+1
53
HardMinimum Time to Complete All Tasksβœ“ Our Solution
60
ArrayBinary SearchStackGreedy+1
54
MediumK Closest Points to Originβœ“ Our Solution
52
ArrayMathDivide and ConquerGeometry+3
55
MediumShortest Bridgeβœ“ Our Solution
52
ArrayDepth-First SearchBreadth-First SearchMatrix
56
MediumGroup Anagramsβœ“ Our Solution
52
ArrayHash TableStringSorting
57
HardBasic Calculator III
52
MathStringStackRecursion
58
MediumAccounts Mergeβœ“ Our Solution
52
ArrayHash TableStringDepth-First Search+3
59
HardMedian of Two Sorted Arraysβœ“ Our Solution
52
ArrayBinary SearchDivide and Conquer
60
MediumProduct of Array Except Selfβœ“ Our Solution
52
ArrayPrefix Sum
61
MediumFind Peak Elementβœ“ Our Solution
52
ArrayBinary Search
62
MediumJump Game IIIβœ“ Our Solution
52
ArrayDepth-First SearchBreadth-First Search
63
EasyMerge Two Sorted Listsβœ“ Our Solution
52
Linked ListRecursion
64
MediumMax Consecutive Ones IIIβœ“ Our Solution
52
ArrayBinary SearchSliding WindowPrefix Sum
65
MediumEdit Distanceβœ“ Our Solution
52
StringDynamic Programming
66
MediumMinimum Remove to Make Valid Parenthesesβœ“ Our Solution
52
StringStack
67
MediumTop K Frequent Elementsβœ“ Our Solution
52
ArrayHash TableDivide and ConquerSorting+4
68
HardBinary Tree Maximum Path Sumβœ“ Our Solution
52
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
69
MediumCourse Scheduleβœ“ Our Solution
52
Depth-First SearchBreadth-First SearchGraphTopological Sort
70
HardReconstruct Itineraryβœ“ Our Solution
52
Depth-First SearchGraphEulerian Circuit
71
MediumMinimum Area Rectangleβœ“ Our Solution
42
ArrayHash TableMathGeometry+1
72
HardShortest Distance from All Buildings
42
ArrayBreadth-First SearchMatrix
73
MediumSearch a 2D Matrix IIβœ“ Our Solution
42
ArrayBinary SearchDivide and ConquerMatrix
74
EasyVerifying an Alien Dictionaryβœ“ Our Solution
42
ArrayHash TableString
75
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
42
ArrayDynamic Programming
76
MediumLongest String Chainβœ“ Our Solution
42
ArrayHash TableTwo PointersString+2
77
MediumCar Fleetβœ“ Our Solution
42
ArrayStackSortingMonotonic Stack
78
MediumKnight Dialerβœ“ Our Solution
42
Dynamic Programming
79
MediumSearch a 2D Matrixβœ“ Our Solution
42
ArrayBinary SearchMatrix
80
MediumThe Maze
42
ArrayDepth-First SearchBreadth-First SearchMatrix
81
MediumNested List Weight Sum
42
Depth-First SearchBreadth-First Search
82
MediumReorder Data in Log Filesβœ“ Our Solution
42
ArrayStringSorting
83
HardMax Stack
42
Linked ListStackDesignDoubly-Linked List+1
84
MediumMovie Ratingβœ“ Our Solution
42
Database
85
MediumRandom Pick with Weightβœ“ Our Solution
42
ArrayMathBinary SearchPrefix Sum+1
86
MediumSubarray Sum Equals Kβœ“ Our Solution
42
ArrayHash TablePrefix Sum
87
MediumMaximize Distance to Closest Personβœ“ Our Solution
42
Array
88
MediumSearch Suggestions Systemβœ“ Our Solution
42
ArrayStringBinary SearchTrie+2
89
HardMinimum Number of Refueling Stopsβœ“ Our Solution
42
ArrayDynamic ProgrammingGreedyHeap (Priority Queue)
90
MediumFlip String to Monotone Increasingβœ“ Our Solution
42
StringDynamic Programming
91
MediumMinimum Cost For Ticketsβœ“ Our Solution
42
ArrayDynamic Programming
92
MediumMinimize Result by Adding Parentheses to Expressionβœ“ Our Solution
42
StringEnumeration
93
HardBuild Binary Expression Tree From Infix Expression
42
StringStackTreeBinary Tree
94
EasyComplement of Base 10 Integerβœ“ Our Solution
42
Bit Manipulation
95
HardMaximum Frequency Stackβœ“ Our Solution
42
Hash TableStackDesignOrdered Set
96
MediumCustom Sort Stringβœ“ Our Solution
42
Hash TableStringSorting
97
MediumDesign Browser Historyβœ“ Our Solution
42
ArrayLinked ListStackDesign+2
98
HardLongest Increasing Path in a Matrixβœ“ Our Solution
42
ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4
99
MediumExclusive Time of Functionsβœ“ Our Solution
42
ArrayStack
100
MediumMaximum Subarrayβœ“ Our Solution
42
ArrayDivide and ConquerDynamic Programming