L
LinkedIn
100 questions tracked82 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
1HardMax Stack
Linked ListStackDesignDoubly-Linked List+1
2MediumNested List Weight Sum II
StackDepth-First SearchBreadth-First Search
3Hash TableLinked ListDesignDoubly-Linked List
4Hash TableStringBreadth-First Search
5MediumFind the Celebrity
Two PointersGraphInteractive
6MediumNested List Weight Sum
Depth-First SearchBreadth-First Search
7MediumShortest Word Distance II
ArrayHash TableTwo PointersString+1
8ArrayDivide and ConquerDynamic Programming
9MediumFind Leaves of Binary Tree
TreeDepth-First SearchBinary Tree
11ArrayDepth-First SearchBreadth-First SearchUnion Find+1
16MediumBinary Tree Upside Down
TreeDepth-First SearchBinary Tree
17ArrayHash TableMathDesign+1
18ArrayDynamic ProgrammingBacktrackingBit Manipulation+2
20MediumPaint House
ArrayDynamic Programming
21StringTreeDepth-First SearchBreadth-First Search+2
22Hash TableStringSliding Window
23TreeDepth-First SearchBreadth-First SearchBinary Tree
24MediumFactor Combinations
Backtracking
25EasyShortest Word Distance
ArrayString
27TreeDepth-First SearchBinary Tree
28ArrayDivide and ConquerSortingHeap (Priority Queue)+1
29Hash TableStringBacktracking
30TreeDepth-First SearchBinary Search TreeBinary Tree
32TreeDepth-First SearchBreadth-First SearchBinary Tree
33MediumSort Transformed Array
ArrayMathTwo PointersSorting
35DesignSegment TreeOrdered Set
39ArrayHash TableMathGeometry
40TreeDepth-First SearchBinary Tree
41HardClosest Binary Search Tree Value II
Two PointersStackTreeDepth-First Search+3
44Hash TableStringBit ManipulationSliding Window+2
45Hash TableLinked ListDesignDoubly-Linked List
46TreeBreadth-First SearchBinary Tree
47MathDynamic ProgrammingBit ManipulationMemoization+2
48StringDynamic Programming
51StackTreeDepth-First SearchDesign+2
52MediumShortest Word Distance III
ArrayString
54Two PointersStringDynamic Programming
55MediumSparse Matrix Multiplication
ArrayHash TableMatrix
56ArrayHeap (Priority Queue)
58TreeBreadth-First SearchBinary Tree
59Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
62ArrayTwo PointersBinary SearchSliding Window+2
63MathTwo PointersBinary Search
64ArrayHeap (Priority Queue)Simulation
65MediumMaximize Total Tastiness of Purchased Fruits
ArrayDynamic Programming
66TreeDepth-First SearchBreadth-First SearchBinary Tree
67Two PointersStringDynamic ProgrammingGreedy
69ArrayMathSortingHeap (Priority Queue)+1
70ArrayHash TableMathDesign+1
71EasyTwo Sum III - Data structure design
ArrayHash TableTwo PointersDesign+1
72ArrayHash TableTreeBinary Tree
73StackTreeDesignBinary Search Tree+2
74ArrayDepth-First SearchBreadth-First SearchUnion Find+1
75StringDynamic Programming
77MediumGraph Valid Tree
Depth-First SearchBreadth-First SearchUnion FindGraph
78ArrayTwo PointersBinary SearchGreedy+1
79MediumNumber of Connected Components in an Undirected Graph
Depth-First SearchBreadth-First SearchUnion FindGraph
81ArrayMathDesignRandomized
82Hash TableStringBacktrackingBreadth-First Search
85Two PointersStringDynamic Programming
87ArrayHash TableTwo PointersBinary Search+1
89TreeDepth-First SearchBinary Tree
90TreeDepth-First SearchBreadth-First SearchBinary Tree
91ArrayBinary SearchDynamic ProgrammingGreedy
92Hash TableStringSliding Window
93ArrayBinary SearchDivide and Conquer
96Linked ListTwo PointersStackRecursion
98StringDepth-First SearchDesignTrie
100TreeDepth-First SearchBinary Search TreeBinary Tree