N

Netflix

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

Showing 38 of 38 questions

1
MediumMerge Intervalsβœ“ Our Solution
100
ArraySorting
2
EasyLogger Rate Limiter
89
Hash TableDesignData Stream
3
MediumMeeting Rooms II
88
ArrayTwo PointersGreedySorting+2
4
HardFirst Missing Positiveβœ“ Our Solution
88
ArrayHash Table
5
HardReconstruct Itineraryβœ“ Our Solution
86
Depth-First SearchGraphEulerian Circuit
6
MediumRandom Pick with Weightβœ“ Our Solution
81
ArrayMathBinary SearchPrefix Sum+1
7
MediumTime Based Key-Value Storeβœ“ Our Solution
76
Hash TableStringBinary SearchDesign
8
MediumFlatten Nested List Iteratorβœ“ Our Solution
76
StackTreeDepth-First SearchDesign+2
9
MediumLRU Cacheβœ“ Our Solution
72
Hash TableLinked ListDesignDoubly-Linked List
10
MediumTop K Frequent Elementsβœ“ Our Solution
72
ArrayHash TableDivide and ConquerSorting+4
11
EasySummary Rangesβœ“ Our Solution
72
Array
12
MediumCache With Time Limitβœ“ Our Solution
68
13
EasyContains Duplicate IIβœ“ Our Solution
64
ArrayHash TableSliding Window
14
MediumLongest Substring Without Repeating Charactersβœ“ Our Solution
64
Hash TableStringSliding Window
15
HardContains Duplicate IIIβœ“ Our Solution
64
ArraySliding WindowSortingBucket Sort+1
16
MediumTop K Frequent Wordsβœ“ Our Solution
57
ArrayHash TableStringTrie+4
17
EasyContains Duplicateβœ“ Our Solution
57
ArrayHash TableSorting
18
MediumKoko Eating Bananasβœ“ Our Solution
57
ArrayBinary Search
19
MediumWord Searchβœ“ Our Solution
57
ArrayStringBacktrackingDepth-First Search+1
20
MediumDaily Temperaturesβœ“ Our Solution
57
ArrayStackMonotonic Stack
21
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
57
ArrayDynamic Programming
22
EasyValid Parenthesesβœ“ Our Solution
57
StringStack
23
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
57
ArrayHash TableMathDesign+1
24
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
57
ArrayBinary Search
25
MediumCourse Schedule IIβœ“ Our Solution
57
Depth-First SearchBreadth-First SearchGraphTopological Sort
26
HardText Justificationβœ“ Our Solution
48
ArrayStringSimulation
27
MediumSpiral Matrixβœ“ Our Solution
48
ArrayMatrixSimulation
28
EasyMerge Sorted Arrayβœ“ Our Solution
48
ArrayTwo PointersSorting
29
HardNumber of Flowers in Full Bloomβœ“ Our Solution
48
ArrayHash TableBinary SearchSorting+2
30
MediumRotate Imageβœ“ Our Solution
48
ArrayMathMatrix
31
MediumCoin Changeβœ“ Our Solution
48
ArrayDynamic ProgrammingBreadth-First Search
32
MediumWord Breakβœ“ Our Solution
48
ArrayHash TableStringDynamic Programming+2
33
MediumGenerate Parenthesesβœ“ Our Solution
48
StringDynamic ProgrammingBacktracking
34
MediumRotate Arrayβœ“ Our Solution
48
ArrayMathTwo Pointers
35
MediumNetwork Delay Timeβœ“ Our Solution
48
Depth-First SearchBreadth-First SearchGraphHeap (Priority Queue)+1
36
MediumMinimum Remove to Make Valid Parenthesesβœ“ Our Solution
48
StringStack
37
EasyTo Be Or Not To Beβœ“ Our Solution
48
38
EasyImplement Queue using Stacksβœ“ Our Solution
48
StackDesignQueue