Netflix LeetCode Questions
29 questions all-time · 5 easy · 19 medium · 5 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Cache With Time Limit | Medium | 100 | 0.8% |
| 2 | Time Based Key-Value Store Hash Table, String, Binary Search, Design | Medium | 94 | 0.5% |
| 3 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 92 | 0.4% |
| 4 | Course Schedule II Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 90 | 0.6% |
| 5 | Meeting Rooms II Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 90 | 0.5% |
| 6 | Reconstruct Itinerary Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit | Hard | 90 | 0.4% |
| 7 | Contains Duplicate III Array, Sliding Window, Sorting, Bucket Sort, Ordered Set | Hard | 90 | 0.2% |
| 8 | Merge Intervals Array, Sorting | Medium | 88 | 0.5% |
| 9 | Logger Rate Limiter Hash Table, Design, Data Stream | Easy | 88 | 0.8% |
| 10 | Parallel Courses Graph Theory, Topological Sort | Medium | 83 | 0.6% |
| 11 | Contains Duplicate II Array, Hash Table, Sliding Window | Easy | 76 | 0.5% |
| 12 | Word Search Array, String, Backtracking, Depth-First Search, Matrix | Medium | 72 | 0.5% |
| 13 | Network Delay Time Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 72 | 0.6% |
| 14 | Contains Duplicate Array, Hash Table, Sorting | Easy | 72 | 0.6% |
| 15 | String to Integer (atoi) String | Medium | 72 | 0.2% |
| 16 | First Missing Positive Array, Hash Table | Hard | 67 | 0.4% |
| 17 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 67 | 0.5% |
| 18 | Summary Ranges Array | Easy | 67 | 0.5% |
| 19 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 60 | 0.7% |
| 20 | Word Break Array, Hash Table, String, Dynamic Programming, Trie, Memoization | Medium | 60 | 0.5% |
| 21 | Koko Eating Bananas Array, Binary Search | Medium | 60 | 0.5% |
| 22 | Fruit Into Baskets Array, Hash Table, Sliding Window | Medium | 51 | 0.5% |
| 23 | All Paths From Source to Target Backtracking, Depth-First Search, Breadth-First Search, Graph Theory | Medium | 51 | 0.8% |
| 24 | Maximum Length of Repeated Subarray Array, Binary Search, Dynamic Programming, Sliding Window, Rolling Hash, Hash Function | Medium | 51 | 0.5% |
| 25 | Snapshot Array Array, Hash Table, Binary Search, Design | Medium | 51 | 0.4% |
| 26 | LFU Cache Hash Table, Linked List, Design, Doubly-Linked List | Hard | 51 | 0.5% |
| 27 | Find Peak Element Array, Binary Search | Medium | 51 | 0.5% |
| 28 | Valid Anagram Hash Table, String, Sorting | Easy | 51 | 0.7% |
| 29 | Design Search Autocomplete System String, Depth-First Search, Design, Trie, Sorting, Heap (Priority Queue), Data Stream | Hard | 51 | 0.5% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.