A

Adobe

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