A

Apple

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

Showing 100 of 100 questions

1
100
ArrayHash Table
2
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
78
Hash TableStringSliding Window
3
EasyLongest Common Prefixβœ“ Our Solution
78
StringTrie
4
EasyValid Parenthesesβœ“ Our Solution
77
StringStack
5
HardMedian of Two Sorted Arraysβœ“ Our Solution
76
ArrayBinary SearchDivide and Conquer
6
MediumMerge Intervalsβœ“ Our Solution
74
ArraySorting
7
MediumGroup Anagramsβœ“ Our Solution
74
ArrayHash TableStringSorting
8
EasyMerge Sorted Arrayβœ“ Our Solution
74
ArrayTwo PointersSorting
9
HardTrapping Rain Waterβœ“ Our Solution
73
ArrayTwo PointersDynamic ProgrammingStack+1
10
MediumReverse Integerβœ“ Our Solution
72
Math
11
MediumValid Sudokuβœ“ Our Solution
72
ArrayHash TableMatrix
12
EasyClimbing Stairsβœ“ Our Solution
70
MathDynamic ProgrammingMemoization
13
MediumLongest Palindromic Substringβœ“ Our Solution
69
Two PointersStringDynamic Programming
14
EasyPalindrome Numberβœ“ Our Solution
68
Math
15
MediumRotate Imageβœ“ Our Solution
67
ArrayMathMatrix
16
MediumSpiral Matrixβœ“ Our Solution
67
ArrayMatrixSimulation
17
MediumAdd Two Numbersβœ“ Our Solution
67
Linked ListMathRecursion
18
67
ArrayTwo PointersSorting
19
EasyRoman to Integerβœ“ Our Solution
66
Hash TableMathString
20
EasyRemove Duplicates from Sorted Arrayβœ“ Our Solution
66
ArrayTwo Pointers
21
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
64
ArrayBinary Search
22
64
MathBinary Search
23
MediumMaximum Subarrayβœ“ Our Solution
64
ArrayDivide and ConquerDynamic Programming
24
EasyMerge Two Sorted Listsβœ“ Our Solution
63
Linked ListRecursion
25
MediumGenerate Parenthesesβœ“ Our Solution
61
StringDynamic ProgrammingBacktracking
26
HardMerge k Sorted Listsβœ“ Our Solution
61
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
27
MediumContainer With Most Waterβœ“ Our Solution
60
ArrayTwo PointersGreedy
28
EasyFind the Index of the First Occurrence in a Stringβœ“ Our Solution
59
Two PointersStringString Matching
29
EasyRemove Elementβœ“ Our Solution
57
ArrayTwo Pointers
30
EasySearch Insert Positionβœ“ Our Solution
56
ArrayBinary Search
31
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
56
Hash TableStringBacktracking
32
HardRegular Expression Matchingβœ“ Our Solution
53
StringDynamic ProgrammingRecursion
33
MediumRemove Nth Node From End of Listβœ“ Our Solution
53
Linked ListTwo Pointers
34
MediumInsert Intervalβœ“ Our Solution
52
Array
35
HardLargest Rectangle in Histogramβœ“ Our Solution
52
ArrayStackMonotonic Stack
36
EasyAdd Binaryβœ“ Our Solution
52
MathStringBit ManipulationSimulation
37
MediumPermutationsβœ“ Our Solution
52
ArrayBacktracking
38
EasyMaximum Depth of Binary Treeβœ“ Our Solution
52
TreeDepth-First SearchBreadth-First SearchBinary Tree
39
MediumBinary Tree Level Order Traversalβœ“ Our Solution
52
TreeBreadth-First SearchBinary Tree
40
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
52
ArrayBinary Search
41
MediumNext Permutationβœ“ Our Solution
51
ArrayTwo Pointers
42
MediumCombination Sumβœ“ Our Solution
48
ArrayBacktracking
43
MediumSort Colorsβœ“ Our Solution
48
ArrayTwo PointersSorting
44
MediumJump Gameβœ“ Our Solution
48
ArrayDynamic ProgrammingGreedy
45
46
ArrayTwo PointersSorting
46
EasySymmetric Treeβœ“ Our Solution
46
TreeDepth-First SearchBreadth-First SearchBinary Tree
47
MediumString to Integer (atoi)βœ“ Our Solution
46
String
48
MediumValidate Binary Search Treeβœ“ Our Solution
46
TreeDepth-First SearchBinary Search TreeBinary Tree
49
HardFirst Missing Positiveβœ“ Our Solution
46
ArrayHash Table
50
MediumPow(x, n)βœ“ Our Solution
44
MathRecursion
51
44
ArrayMath
52
MediumInterleaving Stringβœ“ Our Solution
44
StringDynamic Programming
53
MediumJump Game IIβœ“ Our Solution
44
ArrayDynamic ProgrammingGreedy
54
MediumWord Searchβœ“ Our Solution
42
ArrayStringBacktrackingDepth-First Search+1
55
MediumSearch a 2D Matrixβœ“ Our Solution
42
ArrayBinary SearchMatrix
56
MediumReverse Linked List IIβœ“ Our Solution
42
Linked List
57
MediumDivide Two Integersβœ“ Our Solution
42
MathBit Manipulation
58
EasyBinary Tree Inorder Traversalβœ“ Our Solution
42
StackTreeDepth-First SearchBinary Tree
59
HardWildcard Matchingβœ“ Our Solution
42
StringDynamic ProgrammingGreedyRecursion
60
EasyBalanced Binary Treeβœ“ Our Solution
40
TreeDepth-First SearchBinary Tree
61
MediumSet Matrix Zeroesβœ“ Our Solution
40
ArrayHash TableMatrix
62
MediumCount and Sayβœ“ Our Solution
40
String
63
EasyRemove Duplicates from Sorted Listβœ“ Our Solution
37
Linked List
64
37
ArrayBacktracking
65
MediumSwap Nodes in Pairsβœ“ Our Solution
37
Linked ListRecursion
66
HardText Justificationβœ“ Our Solution
37
ArrayStringSimulation
67
MediumSimplify Pathβœ“ Our Solution
37
StringStack
68
MediumSubsetsβœ“ Our Solution
37
ArrayBacktrackingBit Manipulation
69
HardMinimum Window Substringβœ“ Our Solution
37
Hash TableStringSliding Window
70
MediumZigzag Conversionβœ“ Our Solution
35
String
71
MediumDecode Waysβœ“ Our Solution
35
StringDynamic Programming
72
MediumMinimum Path Sumβœ“ Our Solution
35
ArrayDynamic ProgrammingMatrix
73
MediumInteger to Romanβœ“ Our Solution
35
Hash TableMathString
74
HardReverse Nodes in k-Groupβœ“ Our Solution
35
Linked ListRecursion
75
MediumRotate Listβœ“ Our Solution
35
Linked ListTwo Pointers
76
MediumPartition Listβœ“ Our Solution
31
Linked ListTwo Pointers
77
EasyConvert Sorted Array to Binary Search Treeβœ“ Our Solution
31
ArrayDivide and ConquerTreeBinary Search Tree+1
78
MediumCombinationsβœ“ Our Solution
31
Backtracking
79
MediumEdit Distanceβœ“ Our Solution
27
StringDynamic Programming
80
HardSudoku Solverβœ“ Our Solution
27
ArrayHash TableBacktrackingMatrix
81
EasySame Treeβœ“ Our Solution
27
TreeDepth-First SearchBreadth-First SearchBinary Tree
82
MediumRemove Duplicates from Sorted List IIβœ“ Our Solution
27
Linked ListTwo Pointers
83
EasyLength of Last Wordβœ“ Our Solution
27
String
84
MediumRestore IP Addressesβœ“ Our Solution
27
StringBacktracking
85
MediumUnique Binary Search Trees IIβœ“ Our Solution
27
Dynamic ProgrammingBacktrackingTreeBinary Search Tree+1
86
HardMaximal Rectangleβœ“ Our Solution
22
ArrayDynamic ProgrammingStackMatrix+1
87
MediumConstruct Binary Tree from Preorder and Inorder Traversalβœ“ Our Solution
22
ArrayHash TableDivide and ConquerTree+1
88
MediumMultiply Stringsβœ“ Our Solution
22
MathStringSimulation
89
MediumPermutations IIβœ“ Our Solution
22
ArrayBacktrackingSorting
90
Medium3Sum Closestβœ“ Our Solution
22
ArrayTwo PointersSorting
91
MediumUnique Pathsβœ“ Our Solution
22
MathDynamic ProgrammingCombinatorics
92
HardValid Numberβœ“ Our Solution
22
String
93
HardSubstring with Concatenation of All Wordsβœ“ Our Solution
22
Hash TableStringSliding Window
94
MediumRemove Duplicates from Sorted Array IIβœ“ Our Solution
15
ArrayTwo Pointers
95
MediumSearch in Rotated Sorted Array IIβœ“ Our Solution
15
ArrayBinary Search
96
MediumUnique Paths IIβœ“ Our Solution
15
ArrayDynamic ProgrammingMatrix
97
MediumRecover Binary Search Treeβœ“ Our Solution
15
TreeDepth-First SearchBinary Search TreeBinary Tree
98
MediumUnique Binary Search Treesβœ“ Our Solution
15
MathDynamic ProgrammingTreeBinary Search Tree+1
99
MediumSubsets IIβœ“ Our Solution
15
ArrayBacktrackingBit Manipulation
100
MediumFlatten Binary Tree to Linked Listβœ“ Our Solution
15
Linked ListStackTreeDepth-First Search+1