M
Meta
100 questions tracked100 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
7Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
12Hash TableStringSliding Window
15Hash TableStringBacktracking
16ArrayBacktrackingBit Manipulation
18Hash TableStringSliding Window
19ArrayTwo PointersDynamic ProgrammingStack+1
21Two PointersStringDynamic Programming
23ArrayBinary SearchDivide and Conquer
28ArrayHash TableStringSorting
30MathDynamic ProgrammingMemoization
31ArrayDivide and ConquerDynamic Programming
35MathStringBit ManipulationSimulation
38ArrayStringBacktrackingDepth-First Search+1
40StringDynamic ProgrammingBacktracking
43StringDynamic ProgrammingRecursion
45Two PointersStringString Matching
48TreeBreadth-First SearchBinary Tree
50ArrayStackMonotonic Stack
51TreeBreadth-First SearchBinary Tree
53MathDynamic ProgrammingCombinatorics
55ArrayDynamic ProgrammingGreedy
57TreeDepth-First SearchBinary Search TreeBinary Tree
59StringDynamic Programming
61ArrayBacktrackingBit Manipulation
63ArrayDynamic ProgrammingStackMatrix+1
69StringDynamic ProgrammingGreedyRecursion
70StackTreeDepth-First SearchBinary Tree
71TreeDepth-First SearchBreadth-First SearchBinary Tree
73ArrayDynamic ProgrammingMatrix
75ArrayHash TableDivide and ConquerTree+1
77ArrayDynamic ProgrammingGreedy
80TreeDepth-First SearchBreadth-First SearchBinary Tree
82StringDynamic Programming
84ArrayHash TableBacktrackingMatrix
85TreeDepth-First SearchBreadth-First SearchBinary Tree
86Linked ListDivide and ConquerTreeBinary Search Tree+1
88StringDynamic ProgrammingStack
89TreeDepth-First SearchBreadth-First SearchBinary Tree
93ArrayDivide and ConquerTreeBinary Search Tree+1
94ArrayDynamic ProgrammingMatrix
95TreeDepth-First SearchBinary Tree
97Dynamic ProgrammingBacktrackingTreeBinary Search Tree+1
98Hash TableStringSliding Window
100TreeBreadth-First SearchBinary Tree