O

Oracle

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

Showing 100 of 100 questions

1
MediumLRU Cacheβœ“ Our Solution
100
Hash TableLinked ListDesignDoubly-Linked List
2
MediumNumber of Islandsβœ“ Our Solution
90
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
3
88
ArrayHash Table
4
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
86
Hash TableStringSliding Window
5
MediumMerge Intervalsβœ“ Our Solution
85
ArraySorting
6
MediumGroup Anagramsβœ“ Our Solution
82
ArrayHash TableStringSorting
7
MediumLongest Palindromic Substringβœ“ Our Solution
78
Two PointersStringDynamic Programming
8
HardMerge k Sorted Listsβœ“ Our Solution
73
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
9
HardSliding Window Maximumβœ“ Our Solution
71
ArrayQueueSliding WindowHeap (Priority Queue)+1
10
MediumContainer With Most Waterβœ“ Our Solution
71
ArrayTwo PointersGreedy
11
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
71
ArrayBinary Search
12
MediumBinary Tree Right Side Viewβœ“ Our Solution
70
TreeDepth-First SearchBreadth-First SearchBinary Tree
13
MediumLongest Consecutive Sequenceβœ“ Our Solution
69
ArrayHash TableUnion Find
14
HardTrapping Rain Waterβœ“ Our Solution
67
ArrayTwo PointersDynamic ProgrammingStack+1
15
MediumAdd Two Numbersβœ“ Our Solution
67
Linked ListMathRecursion
16
MediumSpiral Matrixβœ“ Our Solution
67
ArrayMatrixSimulation
17
EasyReverse Linked Listβœ“ Our Solution
64
Linked ListRecursion
18
EasyMerge Two Sorted Listsβœ“ Our Solution
62
Linked ListRecursion
19
MediumJump Gameβœ“ Our Solution
62
ArrayDynamic ProgrammingGreedy
20
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
62
ArrayDynamic Programming
21
MediumPow(x, n)βœ“ Our Solution
62
MathRecursion
22
62
ArrayTwo PointersSorting
23
MediumCourse Scheduleβœ“ Our Solution
62
Depth-First SearchBreadth-First SearchGraphTopological Sort
24
EasyRoman to Integerβœ“ Our Solution
62
Hash TableMathString
25
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
60
TreeBreadth-First SearchBinary Tree
26
HardBinary Tree Maximum Path Sumβœ“ Our Solution
60
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
27
MediumSearch a 2D Matrix IIβœ“ Our Solution
60
ArrayBinary SearchDivide and ConquerMatrix
28
MediumCourse Schedule IIβœ“ Our Solution
60
Depth-First SearchBreadth-First SearchGraphTopological Sort
29
MediumGas Stationβœ“ Our Solution
60
ArrayGreedy
30
EasyLongest Common Prefixβœ“ Our Solution
57
StringTrie
31
MediumMaximum Subarrayβœ“ Our Solution
57
ArrayDivide and ConquerDynamic Programming
32
MediumWord Searchβœ“ Our Solution
57
ArrayStringBacktrackingDepth-First Search+1
33
HardFirst Missing Positiveβœ“ Our Solution
57
ArrayHash Table
34
MediumKth Largest Element in an Arrayβœ“ Our Solution
55
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
35
MediumSet Matrix Zeroesβœ“ Our Solution
55
ArrayHash TableMatrix
36
MediumLowest Common Ancestor of a Binary Treeβœ“ Our Solution
55
TreeDepth-First SearchBinary Tree
37
MediumMin Stackβœ“ Our Solution
55
StackDesign
38
MediumValidate Binary Search Treeβœ“ Our Solution
55
TreeDepth-First SearchBinary Search TreeBinary Tree
39
EasyLinked List Cycleβœ“ Our Solution
55
Hash TableLinked ListTwo Pointers
40
MediumRestore IP Addressesβœ“ Our Solution
55
StringBacktracking
41
MediumProduct of Array Except Selfβœ“ Our Solution
55
ArrayPrefix Sum
42
MediumCombination Sumβœ“ Our Solution
55
ArrayBacktracking
43
EasyValid Anagramβœ“ Our Solution
52
Hash TableStringSorting
44
MediumSort Colorsβœ“ Our Solution
52
ArrayTwo PointersSorting
45
HardMedian of Two Sorted Arraysβœ“ Our Solution
52
ArrayBinary SearchDivide and Conquer
46
MediumZigzag Conversionβœ“ Our Solution
52
String
47
MediumDelete Node in a Linked Listβœ“ Our Solution
52
Linked List
48
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
52
ArrayBinary Search
49
MediumGenerate Parenthesesβœ“ Our Solution
52
StringDynamic ProgrammingBacktracking
50
MediumMaximal Squareβœ“ Our Solution
52
ArrayDynamic ProgrammingMatrix
51
MediumJump Game IIβœ“ Our Solution
52
ArrayDynamic ProgrammingGreedy
52
MediumRotate Imageβœ“ Our Solution
48
ArrayMathMatrix
53
EasyIsomorphic Stringsβœ“ Our Solution
48
Hash TableString
54
EasyRemove Duplicates from Sorted Arrayβœ“ Our Solution
48
ArrayTwo Pointers
55
MediumCombination Sum IIβœ“ Our Solution
48
ArrayBacktracking
56
MediumMinimum Size Subarray Sumβœ“ Our Solution
48
ArrayBinary SearchSliding WindowPrefix Sum
57
EasyMajority Elementβœ“ Our Solution
48
ArrayHash TableDivide and ConquerSorting+1
58
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
48
Hash TableStringBacktracking
59
MediumKth Smallest Element in a BSTβœ“ Our Solution
48
TreeDepth-First SearchBinary Search TreeBinary Tree
60
MediumInteger to Romanβœ“ Our Solution
48
Hash TableMathString
61
MediumPermutationsβœ“ Our Solution
45
ArrayBacktracking
62
MediumCopy List with Random Pointerβœ“ Our Solution
45
Hash TableLinked List
63
HardWord Break IIβœ“ Our Solution
45
ArrayHash TableStringDynamic Programming+3
64
MediumDecode Waysβœ“ Our Solution
45
StringDynamic Programming
65
HardLongest Valid Parenthesesβœ“ Our Solution
45
StringDynamic ProgrammingStack
66
MediumRotate Arrayβœ“ Our Solution
45
ArrayMathTwo Pointers
67
MediumLargest Numberβœ“ Our Solution
45
ArrayStringGreedySorting
68
HardRegular Expression Matchingβœ“ Our Solution
40
StringDynamic ProgrammingRecursion
69
EasyInvert Binary Treeβœ“ Our Solution
40
TreeDepth-First SearchBreadth-First SearchBinary Tree
70
EasyPalindrome Numberβœ“ Our Solution
40
Math
71
MediumFind Peak Elementβœ“ Our Solution
40
ArrayBinary Search
72
MediumInsert Intervalβœ“ Our Solution
40
Array
73
HardMax Points on a Lineβœ“ Our Solution
40
ArrayHash TableMathGeometry
74
EasyMerge Sorted Arrayβœ“ Our Solution
40
ArrayTwo PointersSorting
75
HardSudoku Solverβœ“ Our Solution
40
ArrayHash TableBacktrackingMatrix
76
MediumUnique Pathsβœ“ Our Solution
40
MathDynamic ProgrammingCombinatorics
77
MediumPopulating Next Right Pointers in Each Nodeβœ“ Our Solution
40
Linked ListTreeDepth-First SearchBreadth-First Search+1
78
MediumRotate Listβœ“ Our Solution
40
Linked ListTwo Pointers
79
HardBasic Calculatorβœ“ Our Solution
34
MathStringStackRecursion
80
HardText Justificationβœ“ Our Solution
34
ArrayStringSimulation
81
HardMinimum Window Substringβœ“ Our Solution
34
Hash TableStringSliding Window
82
HardNumber of Unique Good Subsequencesβœ“ Our Solution
34
StringDynamic Programming
83
EasyRemove Duplicates from Sorted Listβœ“ Our Solution
34
Linked List
84
EasyPalindrome Linked Listβœ“ Our Solution
34
Linked ListTwo PointersStackRecursion
85
EasyImplement Queue using Stacksβœ“ Our Solution
34
StackDesignQueue
86
EasyImplement Stack using Queuesβœ“ Our Solution
34
StackDesignQueue
87
MediumTwo Sum II - Input Array Is Sortedβœ“ Our Solution
34
ArrayTwo PointersBinary Search
88
EasyExcel Sheet Column Titleβœ“ Our Solution
34
MathString
89
MediumPath Sum IIβœ“ Our Solution
34
BacktrackingTreeDepth-First SearchBinary Tree
90
MediumSort Listβœ“ Our Solution
34
Linked ListTwo PointersDivide and ConquerSorting+1
91
EasyFind Subsequence of Length K With the Largest Sumβœ“ Our Solution
34
ArrayHash TableSortingHeap (Priority Queue)
92
EasyCount Number of Pairs With Absolute Difference Kβœ“ Our Solution
34
ArrayHash TableCounting
93
EasyPascal's Triangleβœ“ Our Solution
25
ArrayDynamic Programming
94
MediumMaximum Product Subarrayβœ“ Our Solution
25
ArrayDynamic Programming
95
MediumValid Sudokuβœ“ Our Solution
25
ArrayHash TableMatrix
96
MediumLowest Common Ancestor of a Binary Search Treeβœ“ Our Solution
25
TreeDepth-First SearchBinary Search TreeBinary Tree
97
HardMaximal Rectangleβœ“ Our Solution
25
ArrayDynamic ProgrammingStackMatrix+1
98
EasyDelete Duplicate Emailsβœ“ Our Solution
25
Database
99
EasyIntersection of Two Linked Listsβœ“ Our Solution
25
Hash TableLinked ListTwo Pointers
100
EasyClimbing Stairsβœ“ Our Solution
25
MathDynamic ProgrammingMemoization