T

TikTok

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

Showing 100 of 100 questions

1
MediumLRU Cacheβœ“ Our Solution
96
Hash TableLinked ListDesignDoubly-Linked List
2
MediumMerge Intervalsβœ“ Our Solution
90
ArraySorting
3
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
85
Hash TableStringSliding Window
4
HardTrapping Rain Waterβœ“ Our Solution
82
ArrayTwo PointersDynamic ProgrammingStack+1
5
HardMerge k Sorted Listsβœ“ Our Solution
77
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
6
HardMinimum Window Substringβœ“ Our Solution
77
Hash TableStringSliding Window
7
MediumWord Searchβœ“ Our Solution
76
ArrayStringBacktrackingDepth-First Search+1
8
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
75
ArrayBinary Search
9
MediumLongest Palindromic Substringβœ“ Our Solution
73
Two PointersStringDynamic Programming
10
73
ArrayBacktracking
11
MediumRestore IP Addressesβœ“ Our Solution
72
StringBacktracking
12
71
ArrayTwo PointersSorting
13
MediumCombination Sumβœ“ Our Solution
71
ArrayBacktracking
14
HardWord Ladderβœ“ Our Solution
70
Hash TableStringBreadth-First Search
15
69
MathBinary Search
16
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
67
ArrayDynamic Programming
17
HardText Justificationβœ“ Our Solution
67
ArrayStringSimulation
18
EasyValid Parenthesesβœ“ Our Solution
66
StringStack
19
HardBinary Tree Maximum Path Sumβœ“ Our Solution
65
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
20
MediumSort Colorsβœ“ Our Solution
65
ArrayTwo PointersSorting
21
MediumFind Peak Elementβœ“ Our Solution
65
ArrayBinary Search
22
MediumSpiral Matrixβœ“ Our Solution
65
ArrayMatrixSimulation
23
65
ArrayHash Table
24
HardWord Break IIβœ“ Our Solution
63
ArrayHash TableStringDynamic Programming+3
25
MediumConstruct Binary Tree from Preorder and Inorder Traversalβœ“ Our Solution
63
ArrayHash TableDivide and ConquerTree+1
26
MediumCombination Sum IIβœ“ Our Solution
61
ArrayBacktracking
27
MediumPermutationsβœ“ Our Solution
61
ArrayBacktracking
28
MediumGenerate Parenthesesβœ“ Our Solution
61
StringDynamic ProgrammingBacktracking
29
MediumMaximum Subarrayβœ“ Our Solution
61
ArrayDivide and ConquerDynamic Programming
30
MediumEdit Distanceβœ“ Our Solution
61
StringDynamic Programming
31
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
60
ArrayBinary Search
32
MediumContainer With Most Waterβœ“ Our Solution
58
ArrayTwo PointersGreedy
33
HardReverse Nodes in k-Groupβœ“ Our Solution
58
Linked ListRecursion
34
HardRegular Expression Matchingβœ“ Our Solution
58
StringDynamic ProgrammingRecursion
35
MediumWord Breakβœ“ Our Solution
58
ArrayHash TableStringDynamic Programming+2
36
MediumLongest Consecutive Sequenceβœ“ Our Solution
56
ArrayHash TableUnion Find
37
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
56
ArrayDynamic ProgrammingGreedy
38
MediumJump Gameβœ“ Our Solution
56
ArrayDynamic ProgrammingGreedy
39
MediumSubsetsβœ“ Our Solution
53
ArrayBacktrackingBit Manipulation
40
MediumDecode Waysβœ“ Our Solution
53
StringDynamic Programming
41
MediumGroup Anagramsβœ“ Our Solution
53
ArrayHash TableStringSorting
42
EasyMerge Sorted Arrayβœ“ Our Solution
53
ArrayTwo PointersSorting
43
MediumReorder Listβœ“ Our Solution
51
Linked ListTwo PointersStackRecursion
44
MediumUnique Binary Search Treesβœ“ Our Solution
51
MathDynamic ProgrammingTreeBinary Search Tree+1
45
EasyLongest Common Prefixβœ“ Our Solution
51
StringTrie
46
MediumValidate Binary Search Treeβœ“ Our Solution
51
TreeDepth-First SearchBinary Search TreeBinary Tree
47
MediumNext Permutationβœ“ Our Solution
51
ArrayTwo Pointers
48
MediumInteger to Romanβœ“ Our Solution
48
Hash TableMathString
49
MediumMinimum Path Sumβœ“ Our Solution
48
ArrayDynamic ProgrammingMatrix
50
HardParallel Courses IIIβœ“ Our Solution
48
ArrayDynamic ProgrammingGraphTopological Sort
51
HardMedian of Two Sorted Arraysβœ“ Our Solution
48
ArrayBinary SearchDivide and Conquer
52
MediumSurrounded Regionsβœ“ Our Solution
48
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
53
MediumSort Listβœ“ Our Solution
48
Linked ListTwo PointersDivide and ConquerSorting+1
54
MediumPermutations IIβœ“ Our Solution
48
ArrayBacktrackingSorting
55
MediumFind All Possible Recipes from Given Suppliesβœ“ Our Solution
48
ArrayHash TableStringGraph+1
56
MediumReverse Words in a Stringβœ“ Our Solution
44
Two PointersString
57
MediumMaximum Product Subarrayβœ“ Our Solution
44
ArrayDynamic Programming
58
MediumBinary Tree Level Order Traversalβœ“ Our Solution
44
TreeBreadth-First SearchBinary Tree
59
MediumFind Minimum in Rotated Sorted Arrayβœ“ Our Solution
44
ArrayBinary Search
60
MediumReverse Linked List IIβœ“ Our Solution
44
Linked List
61
MediumLongest Substring with At Most Two Distinct Characters
44
Hash TableStringSliding Window
62
MediumCompare Version Numbersβœ“ Our Solution
44
Two PointersString
63
MediumStep-By-Step Directions From a Binary Tree Node to Anotherβœ“ Our Solution
44
StringTreeDepth-First SearchBinary Tree
64
HardLongest Valid Parenthesesβœ“ Our Solution
44
StringDynamic ProgrammingStack
65
MediumAdd Two Numbersβœ“ Our Solution
44
Linked ListMathRecursion
66
EasyClimbing Stairsβœ“ Our Solution
44
MathDynamic ProgrammingMemoization
67
EasyIntersection of Two Linked Listsβœ“ Our Solution
40
Hash TableLinked ListTwo Pointers
68
EasyMissing Ranges
40
Array
69
MediumMultiply Stringsβœ“ Our Solution
40
MathStringSimulation
70
MediumJump Game IIβœ“ Our Solution
40
ArrayDynamic ProgrammingGreedy
71
MediumFraction to Recurring Decimalβœ“ Our Solution
40
Hash TableMathString
72
HardDistinct Subsequencesβœ“ Our Solution
40
StringDynamic Programming
73
EasyMerge Two Sorted Listsβœ“ Our Solution
40
Linked ListRecursion
74
MediumSimplify Pathβœ“ Our Solution
35
StringStack
75
EasyFind Target Indices After Sorting Arrayβœ“ Our Solution
35
ArrayBinary SearchSorting
76
MediumPow(x, n)βœ“ Our Solution
35
MathRecursion
77
HardBest Time to Buy and Sell Stock IIIβœ“ Our Solution
35
ArrayDynamic Programming
78
HardWord Ladder IIβœ“ Our Solution
35
Hash TableStringBacktrackingBreadth-First Search
79
EasyValid Palindromeβœ“ Our Solution
35
Two PointersString
80
MediumSpiral Matrix IIβœ“ Our Solution
35
ArrayMatrixSimulation
81
MediumRemove Duplicates from Sorted Array IIβœ“ Our Solution
35
ArrayTwo Pointers
82
MediumPath Sum IIβœ“ Our Solution
35
BacktrackingTreeDepth-First SearchBinary Tree
83
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
35
TreeBreadth-First SearchBinary Tree
84
MediumInsert Intervalβœ“ Our Solution
35
Array
85
29
ArrayTwo PointersSorting
86
MediumLinked List Cycle IIβœ“ Our Solution
29
Hash TableLinked ListTwo Pointers
87
29
ArrayMath
88
MediumSwap Nodes in Pairsβœ“ Our Solution
29
Linked ListRecursion
89
29
TreeDepth-First SearchBreadth-First SearchBinary Tree
90
HardMaximal Rectangleβœ“ Our Solution
29
ArrayDynamic ProgrammingStackMatrix+1
91
MediumValid Sudokuβœ“ Our Solution
29
ArrayHash TableMatrix
92
MediumInterleaving Stringβœ“ Our Solution
21
StringDynamic Programming
93
MediumClone Graphβœ“ Our Solution
21
Hash TableDepth-First SearchBreadth-First SearchGraph
94
MediumRecover Binary Search Treeβœ“ Our Solution
21
TreeDepth-First SearchBinary Search TreeBinary Tree
95
MediumSubsets IIβœ“ Our Solution
21
ArrayBacktrackingBit Manipulation
96
HardValid Numberβœ“ Our Solution
21
String
97
MediumUnique Pathsβœ“ Our Solution
21
MathDynamic ProgrammingCombinatorics
98
MediumDivide Two Integersβœ“ Our Solution
21
MathBit Manipulation
99
HardFirst Missing Positiveβœ“ Our Solution
21
ArrayHash Table
100
MediumSum of Subarray Rangesβœ“ Our Solution
21
ArrayStackMonotonic Stack