P

PayPal

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

Showing 100 of 100 questions

1
MediumZigzag Conversionβœ“ Our Solution
100
String
2
MediumLRU Cacheβœ“ Our Solution
79
Hash TableLinked ListDesignDoubly-Linked List
3
HardMinimum Replacements to Sort the Arrayβœ“ Our Solution
78
ArrayMathGreedy
4
MediumCount Vowel Strings in Rangesβœ“ Our Solution
78
ArrayStringPrefix Sum
5
EasyCount the Number of Vowel Strings in Rangeβœ“ Our Solution
78
ArrayStringCounting
6
MediumMeeting Scheduler
76
ArrayTwo PointersSorting
7
MediumMaximum Number of Integers to Choose From a Range Iβœ“ Our Solution
76
ArrayHash TableBinary SearchGreedy+1
8
HardNumber of Valid Move Combinations On Chessboardβœ“ Our Solution
76
ArrayStringBacktrackingSimulation
9
MediumWord Searchβœ“ Our Solution
76
ArrayStringBacktrackingDepth-First Search+1
10
MediumTime Needed to Rearrange a Binary Stringβœ“ Our Solution
76
StringDynamic ProgrammingSimulation
11
MediumNumber of Islandsβœ“ Our Solution
76
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
12
HardMaximum Frequency Score of a Subarray
76
ArrayHash TableMathStack+1
13
MediumMinimum Non-Zero Product of the Array Elementsβœ“ Our Solution
73
MathGreedyRecursion
14
MediumMaximum Number of Integers to Choose From a Range II
73
ArrayBinary SearchGreedySorting
15
HardPaint House IIIβœ“ Our Solution
73
ArrayDynamic Programming
16
MediumMaximum Sum Obtained of Any Permutationβœ“ Our Solution
73
ArrayGreedySortingPrefix Sum
17
HardCount Array Pairs Divisible by Kβœ“ Our Solution
73
ArrayMathNumber Theory
18
MediumSmallest Greater Multiple Made of Two Digits
73
MathEnumeration
19
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
73
ArrayDynamic Programming
20
MediumGroup Anagramsβœ“ Our Solution
73
ArrayHash TableStringSorting
21
MediumLongest Increasing Subsequenceβœ“ Our Solution
71
ArrayBinary SearchDynamic Programming
22
MediumMaximal Squareβœ“ Our Solution
71
ArrayDynamic ProgrammingMatrix
23
71
ArrayHash Table
24
MediumProduct of Array Except Selfβœ“ Our Solution
68
ArrayPrefix Sum
25
MediumCoin Changeβœ“ Our Solution
68
ArrayDynamic ProgrammingBreadth-First Search
26
MediumPairs of Songs With Total Durations Divisible by 60βœ“ Our Solution
66
ArrayHash TableCounting
27
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
62
Hash TableStringSliding Window
28
EasyMinimum Absolute Differenceβœ“ Our Solution
62
ArraySorting
29
MediumMerge Intervalsβœ“ Our Solution
62
ArraySorting
30
EasyMerge Sorted Arrayβœ“ Our Solution
62
ArrayTwo PointersSorting
31
MediumSubarray Sum Equals Kβœ“ Our Solution
62
ArrayHash TablePrefix Sum
32
MediumFind the Smallest Divisor Given a Thresholdβœ“ Our Solution
58
ArrayBinary Search
33
MediumMaximum Number of Events That Can Be Attendedβœ“ Our Solution
58
ArrayGreedySortingHeap (Priority Queue)
34
MediumLoud and Richβœ“ Our Solution
58
ArrayDepth-First SearchGraphTopological Sort
35
MediumReorganize Stringβœ“ Our Solution
58
Hash TableStringGreedySorting+2
36
EasyValid Anagramβœ“ Our Solution
53
Hash TableStringSorting
37
EasyCount Vowel Substrings of a Stringβœ“ Our Solution
53
Hash TableString
38
EasyValid Parenthesesβœ“ Our Solution
53
StringStack
39
HardTrapping Rain Waterβœ“ Our Solution
53
ArrayTwo PointersDynamic ProgrammingStack+1
40
MediumHouse Robberβœ“ Our Solution
53
ArrayDynamic Programming
41
HardMeeting Rooms IIIβœ“ Our Solution
53
ArrayHash TableSortingHeap (Priority Queue)+1
42
MediumRandom Pick with Weightβœ“ Our Solution
53
ArrayMathBinary SearchPrefix Sum+1
43
MediumSort Colorsβœ“ Our Solution
53
ArrayTwo PointersSorting
44
EasyLast Stone Weightβœ“ Our Solution
53
ArrayHeap (Priority Queue)
45
MediumTop K Frequent Elementsβœ“ Our Solution
53
ArrayHash TableDivide and ConquerSorting+4
46
MediumMinimum Increment to Make Array Uniqueβœ“ Our Solution
47
ArrayGreedySortingCounting
47
MediumMaximum Subarrayβœ“ Our Solution
47
ArrayDivide and ConquerDynamic Programming
48
HardMedian of Two Sorted Arraysβœ“ Our Solution
47
ArrayBinary SearchDivide and Conquer
49
MediumKth Largest Element in an Arrayβœ“ Our Solution
47
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
50
MediumRotate Imageβœ“ Our Solution
47
ArrayMathMatrix
51
MediumKoko Eating Bananasβœ“ Our Solution
47
ArrayBinary Search
52
MediumPalindromic Substringsβœ“ Our Solution
47
Two PointersStringDynamic Programming
53
MediumJump Gameβœ“ Our Solution
47
ArrayDynamic ProgrammingGreedy
54
HardText Justificationβœ“ Our Solution
47
ArrayStringSimulation
55
MediumMinimum Number of Swaps to Make the String Balancedβœ“ Our Solution
47
Two PointersStringStackGreedy
56
Medium3Sum Smaller
47
ArrayTwo PointersBinary SearchSorting
57
MediumCount and Sayβœ“ Our Solution
47
String
58
MediumSubarray Product Less Than Kβœ“ Our Solution
47
ArrayBinary SearchSliding WindowPrefix Sum
59
EasyReverse Linked Listβœ“ Our Solution
47
Linked ListRecursion
60
EasyHappy Numberβœ“ Our Solution
47
Hash TableMathTwo Pointers
61
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
47
ArrayBinary Search
62
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
47
ArrayBinary Search
63
EasyDegree of an Arrayβœ“ Our Solution
47
ArrayHash Table
64
MediumValid Sudokuβœ“ Our Solution
47
ArrayHash TableMatrix
65
MediumFlatten Deeply Nested Arrayβœ“ Our Solution
47
66
HardLFU Cacheβœ“ Our Solution
47
Hash TableLinked ListDesignDoubly-Linked List
67
47
ArrayTwo PointersSorting
68
MediumLongest Consecutive Sequenceβœ“ Our Solution
47
ArrayHash TableUnion Find
69
MediumMeeting Rooms II
38
ArrayTwo PointersGreedySorting+2
70
EasySquares of a Sorted Arrayβœ“ Our Solution
38
ArrayTwo PointersSorting
71
MediumCourse Scheduleβœ“ Our Solution
38
Depth-First SearchBreadth-First SearchGraphTopological Sort
72
MediumSearch a 2D Matrix IIβœ“ Our Solution
38
ArrayBinary SearchDivide and ConquerMatrix
73
HardMaximum Profit in Job Schedulingβœ“ Our Solution
38
ArrayBinary SearchDynamic ProgrammingSorting
74
MediumSpiral Matrixβœ“ Our Solution
38
ArrayMatrixSimulation
75
MediumFlatten Binary Tree to Linked Listβœ“ Our Solution
38
Linked ListStackTreeDepth-First Search+1
76
HardFind Median from Data Streamβœ“ Our Solution
38
Two PointersDesignSortingHeap (Priority Queue)+1
77
EasyFind Pivot Indexβœ“ Our Solution
38
ArrayPrefix Sum
78
38
TreeDepth-First SearchBreadth-First SearchBinary Tree
79
MediumMaximum Product Subarrayβœ“ Our Solution
38
ArrayDynamic Programming
80
EasyLexicographically Smallest Palindromeβœ“ Our Solution
38
Two PointersStringGreedy
81
EasyMaximum Population Yearβœ“ Our Solution
38
ArrayCountingPrefix Sum
82
MediumMin Stackβœ“ Our Solution
38
StackDesign
83
HardWord Search IIβœ“ Our Solution
38
ArrayStringBacktrackingTrie+1
84
MediumDelete Node in a Linked Listβœ“ Our Solution
38
Linked List
85
HardMinimum Window Substringβœ“ Our Solution
38
Hash TableStringSliding Window
86
EasyFirst Unique Character in a Stringβœ“ Our Solution
38
Hash TableStringQueueCounting
87
HardMaximum Frequency Stackβœ“ Our Solution
38
Hash TableStackDesignOrdered Set
88
MediumInvalid Transactionsβœ“ Our Solution
38
ArrayHash TableStringSorting
89
MediumContainer With Most Waterβœ“ Our Solution
38
ArrayTwo PointersGreedy
90
MediumProcess Tasks Using Serversβœ“ Our Solution
38
ArrayHeap (Priority Queue)
91
MediumFind Peak Elementβœ“ Our Solution
38
ArrayBinary Search
92
EasyIntersection of Two Arraysβœ“ Our Solution
38
ArrayHash TableTwo PointersBinary Search+1
93
MediumFind Minimum in Rotated Sorted Arrayβœ“ Our Solution
38
ArrayBinary Search
94
HardMinimum Number of Removals to Make Mountain Arrayβœ“ Our Solution
38
ArrayBinary SearchDynamic ProgrammingGreedy
95
MediumDivide Players Into Teams of Equal Skillβœ“ Our Solution
38
ArrayHash TableTwo PointersSorting
96
MediumJump Game IIβœ“ Our Solution
38
ArrayDynamic ProgrammingGreedy
97
MediumNumber of Substrings Containing All Three Charactersβœ“ Our Solution
38
Hash TableStringSliding Window
98
HardFirst Missing Positiveβœ“ Our Solution
38
ArrayHash Table
99
MediumMerge In Between Linked Listsβœ“ Our Solution
38
Linked List
100
MediumDesign Twitterβœ“ Our Solution
38
Hash TableLinked ListDesignHeap (Priority Queue)