L

LinkedIn

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

Showing 100 of 100 questions

1
HardMax Stack
100
Linked ListStackDesignDoubly-Linked List+1
2
MediumNested List Weight Sum II
95
StackDepth-First SearchBreadth-First Search
3
HardAll O`one Data Structureβœ“ Our Solution
94
Hash TableLinked ListDesignDoubly-Linked List
4
HardWord Ladderβœ“ Our Solution
79
Hash TableStringBreadth-First Search
5
MediumFind the Celebrity
79
Two PointersGraphInteractive
6
MediumNested List Weight Sum
78
Depth-First SearchBreadth-First Search
7
MediumShortest Word Distance II
77
ArrayHash TableTwo PointersString+1
8
MediumMaximum Subarrayβœ“ Our Solution
77
ArrayDivide and ConquerDynamic Programming
9
MediumFind Leaves of Binary Tree
77
TreeDepth-First SearchBinary Tree
10
EasyValid Parenthesesβœ“ Our Solution
77
StringStack
11
MediumNumber of Islandsβœ“ Our Solution
76
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
12
MediumMaximum Product Subarrayβœ“ Our Solution
73
ArrayDynamic Programming
13
EasyCan Place Flowersβœ“ Our Solution
72
ArrayGreedy
14
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
71
ArrayBinary Search
15
MediumPow(x, n)βœ“ Our Solution
71
MathRecursion
16
MediumBinary Tree Upside Down
69
TreeDepth-First SearchBinary Tree
17
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
69
ArrayHash TableMathDesign+1
18
MediumPartition to K Equal Sum Subsetsβœ“ Our Solution
69
ArrayDynamic ProgrammingBacktrackingBit Manipulation+2
19
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
68
ArrayBinary Search
20
MediumPaint House
68
ArrayDynamic Programming
21
HardSerialize and Deserialize Binary Treeβœ“ Our Solution
66
StringTreeDepth-First SearchBreadth-First Search+2
22
HardMinimum Window Substringβœ“ Our Solution
65
Hash TableStringSliding Window
23
EasyMaximum Depth of Binary Treeβœ“ Our Solution
64
TreeDepth-First SearchBreadth-First SearchBinary Tree
24
MediumFactor Combinations
64
Backtracking
25
EasyShortest Word Distance
64
ArrayString
26
MediumExclusive Time of Functionsβœ“ Our Solution
64
ArrayStack
27
MediumLowest Common Ancestor of a Binary Treeβœ“ Our Solution
63
TreeDepth-First SearchBinary Tree
28
MediumKth Largest Element in an Arrayβœ“ Our Solution
63
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
29
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
63
Hash TableStringBacktracking
30
MediumLowest Common Ancestor of a Binary Search Treeβœ“ Our Solution
62
TreeDepth-First SearchBinary Search TreeBinary Tree
31
EasyIsomorphic Stringsβœ“ Our Solution
62
Hash TableString
32
EasySymmetric Treeβœ“ Our Solution
61
TreeDepth-First SearchBreadth-First SearchBinary Tree
33
MediumSort Transformed Array
61
ArrayMathTwo PointersSorting
34
MediumMerge Intervalsβœ“ Our Solution
61
ArraySorting
35
HardCount Integers in Intervalsβœ“ Our Solution
60
DesignSegment TreeOrdered Set
36
EasyValid Perfect Squareβœ“ Our Solution
60
MathBinary Search
37
HardValid Numberβœ“ Our Solution
60
String
38
HardKth Smallest Product of Two Sorted Arraysβœ“ Our Solution
60
ArrayBinary Search
39
HardMax Points on a Lineβœ“ Our Solution
59
ArrayHash TableMathGeometry
40
EasySecond Minimum Node In a Binary Treeβœ“ Our Solution
59
TreeDepth-First SearchBinary Tree
41
HardClosest Binary Search Tree Value II
59
Two PointersStackTreeDepth-First Search+3
42
MediumHouse Robberβœ“ Our Solution
58
ArrayDynamic Programming
43
MediumEvaluate Reverse Polish Notationβœ“ Our Solution
58
ArrayMathStack
44
MediumRepeated DNA Sequencesβœ“ Our Solution
58
Hash TableStringBit ManipulationSliding Window+2
45
MediumLRU Cacheβœ“ Our Solution
56
Hash TableLinked ListDesignDoubly-Linked List
46
MediumBinary Tree Level Order Traversalβœ“ Our Solution
56
TreeBreadth-First SearchBinary Tree
47
MediumCan I Winβœ“ Our Solution
56
MathDynamic ProgrammingBit ManipulationMemoization+2
48
MediumLongest Palindromic Subsequenceβœ“ Our Solution
56
StringDynamic Programming
49
MediumPermutations IIβœ“ Our Solution
55
ArrayBacktrackingSorting
50
EasyMerge Two Sorted Listsβœ“ Our Solution
55
Linked ListRecursion
51
MediumFlatten Nested List Iteratorβœ“ Our Solution
55
StackTreeDepth-First SearchDesign+2
52
MediumShortest Word Distance III
55
ArrayString
53
MediumPermutationsβœ“ Our Solution
55
ArrayBacktracking
54
MediumPalindromic Substringsβœ“ Our Solution
53
Two PointersStringDynamic Programming
55
MediumSparse Matrix Multiplication
53
ArrayHash TableMatrix
56
MediumFind K Pairs with Smallest Sumsβœ“ Our Solution
53
ArrayHeap (Priority Queue)
57
53
ArrayHash Table
58
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
53
TreeBreadth-First SearchBinary Tree
59
HardMerge k Sorted Listsβœ“ Our Solution
53
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
60
MediumProduct of Array Except Selfβœ“ Our Solution
52
ArrayPrefix Sum
61
HardText Justificationβœ“ Our Solution
52
ArrayStringSimulation
62
MediumFind K Closest Elementsβœ“ Our Solution
50
ArrayTwo PointersBinary SearchSliding Window+2
63
MediumSum of Square Numbersβœ“ Our Solution
50
MathTwo PointersBinary Search
64
HardTime to Cross a Bridgeβœ“ Our Solution
50
ArrayHeap (Priority Queue)Simulation
65
MediumMaximize Total Tastiness of Purchased Fruits
50
ArrayDynamic Programming
66
MediumFind Largest Value in Each Tree Rowβœ“ Our Solution
50
TreeDepth-First SearchBreadth-First SearchBinary Tree
67
HardMaximum Number of Non-overlapping Palindrome Substringsβœ“ Our Solution
50
Two PointersStringDynamic ProgrammingGreedy
68
MediumInsert Intervalβœ“ Our Solution
50
Array
69
HardMinimum Deletions to Make Array Divisibleβœ“ Our Solution
50
ArrayMathSortingHeap (Priority Queue)+1
70
HardInsert Delete GetRandom O(1) - Duplicates allowedβœ“ Our Solution
50
ArrayHash TableMathDesign+1
71
EasyTwo Sum III - Data structure design
50
ArrayHash TableTwo PointersDesign+1
72
MediumCreate Binary Tree From Descriptionsβœ“ Our Solution
50
ArrayHash TableTreeBinary Tree
73
MediumBinary Search Tree Iteratorβœ“ Our Solution
50
StackTreeDesignBinary Search Tree+2
74
MediumMax Area of Islandβœ“ Our Solution
48
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
75
MediumEdit Distanceβœ“ Our Solution
46
StringDynamic Programming
76
MediumRotate Listβœ“ Our Solution
46
Linked ListTwo Pointers
77
MediumGraph Valid Tree
46
Depth-First SearchBreadth-First SearchUnion FindGraph
78
MediumValid Triangle Numberβœ“ Our Solution
46
ArrayTwo PointersBinary SearchGreedy+1
79
MediumNumber of Connected Components in an Undirected Graph
43
Depth-First SearchBreadth-First SearchUnion FindGraph
80
MediumMin Stackβœ“ Our Solution
43
StackDesign
81
MediumShuffle an Arrayβœ“ Our Solution
41
ArrayMathDesignRandomized
82
HardWord Ladder IIβœ“ Our Solution
41
Hash TableStringBacktrackingBreadth-First Search
83
MediumCombination Sumβœ“ Our Solution
37
ArrayBacktracking
84
EasyMerge Sorted Arrayβœ“ Our Solution
37
ArrayTwo PointersSorting
85
MediumLongest Palindromic Substringβœ“ Our Solution
37
Two PointersStringDynamic Programming
86
MediumInteger to Romanβœ“ Our Solution
33
Hash TableMathString
87
EasyIntersection of Two Arraysβœ“ Our Solution
33
ArrayHash TableTwo PointersBinary Search+1
88
EasyFizz Buzzβœ“ Our Solution
33
MathStringSimulation
89
EasyDiameter of Binary Treeβœ“ Our Solution
28
TreeDepth-First SearchBinary Tree
90
EasySame Treeβœ“ Our Solution
28
TreeDepth-First SearchBreadth-First SearchBinary Tree
91
MediumHouse Robber IVβœ“ Our Solution
28
ArrayBinary SearchDynamic ProgrammingGreedy
92
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
28
Hash TableStringSliding Window
93
HardMedian of Two Sorted Arraysβœ“ Our Solution
28
ArrayBinary SearchDivide and Conquer
94
MediumHouse Robber IIβœ“ Our Solution
28
ArrayDynamic Programming
95
MediumNext Permutationβœ“ Our Solution
21
ArrayTwo Pointers
96
MediumReorder Listβœ“ Our Solution
21
Linked ListTwo PointersStackRecursion
97
EasyMinimum Time to Type Word Using Special Typewriterβœ“ Our Solution
21
StringGreedy
98
MediumDesign Add and Search Words Data Structureβœ“ Our Solution
21
StringDepth-First SearchDesignTrie
99
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
21
ArrayDynamic Programming
100
MediumValidate Binary Search Treeβœ“ Our Solution
21
TreeDepth-First SearchBinary Search TreeBinary Tree