E

eBay

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

Showing 78 of 78 questions

1
MediumPartition Equal Subset Sumβœ“ Our Solution
100
ArrayDynamic Programming
2
MediumLRU Cacheβœ“ Our Solution
98
Hash TableLinked ListDesignDoubly-Linked List
3
EasyRemove One Element to Make the Array Strictly Increasingβœ“ Our Solution
95
Array
4
EasySubtree of Another Treeβœ“ Our Solution
95
TreeDepth-First SearchString MatchingBinary Tree+1
5
EasyAlternating Digit Sumβœ“ Our Solution
95
Math
6
HardMinimum Window Subsequence
95
StringDynamic ProgrammingSliding Window
7
EasyBinary Gapβœ“ Our Solution
95
Bit Manipulation
8
HardDesign Skiplistβœ“ Our Solution
95
Linked ListDesign
9
MediumMinimize Maximum Pair Sum in Arrayβœ“ Our Solution
95
ArrayTwo PointersGreedySorting
10
MediumNumber of Islandsβœ“ Our Solution
89
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
11
HardWord Ladderβœ“ Our Solution
82
Hash TableStringBreadth-First Search
12
EasyMove Zeroesβœ“ Our Solution
77
ArrayTwo Pointers
13
MediumGroup Anagramsβœ“ Our Solution
77
ArrayHash TableStringSorting
14
MediumSpiral Matrixβœ“ Our Solution
77
ArrayMatrixSimulation
15
MediumOpen the Lockβœ“ Our Solution
77
ArrayHash TableStringBreadth-First Search
16
HardReconstruct Itineraryβœ“ Our Solution
71
Depth-First SearchGraphEulerian Circuit
17
MediumKth Largest Element in an Arrayβœ“ Our Solution
71
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
18
MediumSet Matrix Zeroesβœ“ Our Solution
71
ArrayHash TableMatrix
19
HardWord Search IIβœ“ Our Solution
71
ArrayStringBacktrackingTrie+1
20
MediumCourse Schedule IIβœ“ Our Solution
71
Depth-First SearchBreadth-First SearchGraphTopological Sort
21
EasyValid Parenthesesβœ“ Our Solution
71
StringStack
22
MediumCourse Scheduleβœ“ Our Solution
71
Depth-First SearchBreadth-First SearchGraphTopological Sort
23
MediumMeeting Rooms II
71
ArrayTwo PointersGreedySorting+2
24
MediumLongest Continuous Subarray With Absolute Diff Less Than or Equal to Limitβœ“ Our Solution
71
ArrayQueueSliding WindowHeap (Priority Queue)+2
25
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
71
TreeBreadth-First SearchBinary Tree
26
MediumBinary Search Tree to Greater Sum Treeβœ“ Our Solution
63
TreeDepth-First SearchBinary Search TreeBinary Tree
27
HardConcatenated Wordsβœ“ Our Solution
63
ArrayStringDynamic ProgrammingDepth-First Search+1
28
MediumGenerate Parenthesesβœ“ Our Solution
63
StringDynamic ProgrammingBacktracking
29
MediumRotting Orangesβœ“ Our Solution
63
ArrayBreadth-First SearchMatrix
30
MediumPow(x, n)βœ“ Our Solution
63
MathRecursion
31
MediumLongest ZigZag Path in a Binary Treeβœ“ Our Solution
63
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
32
MediumDesign a Stack With Increment Operationβœ“ Our Solution
63
ArrayStackDesign
33
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
63
Hash TableStringSliding Window
34
63
ArrayHash Table
35
MediumDecode Stringβœ“ Our Solution
63
StringStackRecursion
36
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
63
ArrayBinary Search
37
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
63
ArrayDynamic ProgrammingGreedy
38
EasyMeeting Rooms
53
ArraySorting
39
HardInteger to English Wordsβœ“ Our Solution
53
MathStringRecursion
40
EasyValid Palindrome IIβœ“ Our Solution
53
Two PointersStringGreedy
41
HardLongest Valid Parenthesesβœ“ Our Solution
53
StringDynamic ProgrammingStack
42
MediumMinimum Path Sumβœ“ Our Solution
53
ArrayDynamic ProgrammingMatrix
43
HardMerge k Sorted Listsβœ“ Our Solution
53
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
44
HardBinary Tree Camerasβœ“ Our Solution
53
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
45
MediumProduct of Array Except Selfβœ“ Our Solution
53
ArrayPrefix Sum
46
EasyRoman to Integerβœ“ Our Solution
53
Hash TableMathString
47
EasyLongest Common Prefixβœ“ Our Solution
53
StringTrie
48
HardVertical Order Traversal of a Binary Treeβœ“ Our Solution
53
Hash TableTreeDepth-First SearchBreadth-First Search+2
49
MediumMatchsticks to Squareβœ“ Our Solution
53
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1
50
EasyIsomorphic Stringsβœ“ Our Solution
53
Hash TableString
51
MediumInteger to Romanβœ“ Our Solution
53
Hash TableMathString
52
MediumNearest Exit from Entrance in Mazeβœ“ Our Solution
53
ArrayBreadth-First SearchMatrix
53
MediumTime Based Key-Value Storeβœ“ Our Solution
53
Hash TableStringBinary SearchDesign
54
MediumLongest Palindromic Substringβœ“ Our Solution
53
Two PointersStringDynamic Programming
55
HardMedian of Two Sorted Arraysβœ“ Our Solution
53
ArrayBinary SearchDivide and Conquer
56
MediumFind Peak Elementβœ“ Our Solution
53
ArrayBinary Search
57
HardFirst Missing Positiveβœ“ Our Solution
53
ArrayHash Table
58
MediumMaximum Subarrayβœ“ Our Solution
53
ArrayDivide and ConquerDynamic Programming
59
MediumPermutationsβœ“ Our Solution
53
ArrayBacktracking
60
MediumValidate Binary Search Treeβœ“ Our Solution
53
TreeDepth-First SearchBinary Search TreeBinary Tree
61
MediumNested List Weight Sum
53
Depth-First SearchBreadth-First Search
62
MediumTop K Frequent Elementsβœ“ Our Solution
53
ArrayHash TableDivide and ConquerSorting+4
63
MediumMaximal Squareβœ“ Our Solution
53
ArrayDynamic ProgrammingMatrix
64
HardShortest Palindromeβœ“ Our Solution
53
StringRolling HashString MatchingHash Function
65
MediumMaximum Tastiness of Candy Basketβœ“ Our Solution
53
ArrayBinary SearchGreedySorting
66
MediumRotate Arrayβœ“ Our Solution
53
ArrayMathTwo Pointers
67
EasyMajority Elementβœ“ Our Solution
53
ArrayHash TableDivide and ConquerSorting+1
68
EasyFind Pivot Indexβœ“ Our Solution
53
ArrayPrefix Sum
69
MediumTwo Sum II - Input Array Is Sortedβœ“ Our Solution
53
ArrayTwo PointersBinary Search
70
MediumReorganize Stringβœ“ Our Solution
53
Hash TableStringGreedySorting+2
71
MediumLongest Substring with At Most Two Distinct Characters
53
Hash TableStringSliding Window
72
MediumKoko Eating Bananasβœ“ Our Solution
53
ArrayBinary Search
73
MediumFind Minimum in Rotated Sorted Arrayβœ“ Our Solution
53
ArrayBinary Search
74
MediumWord Breakβœ“ Our Solution
53
ArrayHash TableStringDynamic Programming+2
75
MediumCopy List with Random Pointerβœ“ Our Solution
53
Hash TableLinked List
76
MediumRank Teams by Votesβœ“ Our Solution
53
ArrayHash TableStringSorting+1
77
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
53
ArrayDynamic Programming
78
MediumSort Colorsβœ“ Our Solution
53
ArrayTwo PointersSorting