DSA Doctor
Verified Company Vault
Netflix DSA Interview Questions
31 curated coding interview questions directly asked in Netflix technical rounds, sorted by frequency with recency and difficulty diagnostics.
31
Total Questions
7 (23%)
Easy Problems
20 (65%)
Medium Problems
4 (13%)
Hard Problems
🔥 Most Tested Topics:
Arrays (8)Strings (6)Core DSA (6)Graphs (3)Design (3)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 100.0% | 3m |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 100.0% | 3m |
| 1136 | Parallel Courses | Medium | Graphs | BFS / DFS / Topological Sort | 62.2% | 100.0% | 6m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 100.0% | all |
| 8 | String to Integer (atoi) | Medium | Strings | Hashing / Sliding Window | 21.0% | 87.5% | 3m |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 87.5% | 3m |
| 220 | Contains Duplicate III | Hard | Arrays | Sorting / Prefix / Scan | 24.8% | 87.5% | 3m |
| 2622 | Cache With Time Limit | Medium | Core DSA | Implementation / Reasoning | 76.1% | 87.5% | 3m |
| 332 | Reconstruct Itinerary | Hard | Core DSA | Implementation / Reasoning | 44.6% | 87.5% | all |
| 359 | Logger Rate Limiter | Easy | Design | Data Structure Design | 76.8% | 87.5% | all |
| 1146 | Snapshot Array | Medium | Arrays | Sorting / Prefix / Scan | 36.8% | 75.0% | 6m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | 6m |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 75.0% | 6m |
| 219 | Contains Duplicate II | Easy | Arrays | Sorting / Prefix / Scan | 51.3% | 75.0% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 75.0% | all |
| 743 | Network Delay Time | Medium | Graphs | BFS / DFS / Topological Sort | 60.4% | 75.0% | all |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 75.0% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 62.5% | all |
| 228 | Summary Ranges | Easy | Arrays | Sorting / Prefix / Scan | 54.2% | 62.5% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 62.5% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 62.5% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 50.0% | all |
| 904 | Fruit Into Baskets | Medium | Core DSA | Implementation / Reasoning | 51.1% | 50.0% | all |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 50.0% | all |
| 797 | All Paths From Source to Target | Medium | Core DSA | Implementation / Reasoning | 83.6% | 50.0% | all |
| 718 | Maximum Length of Repeated Subarray | Medium | Arrays | Sorting / Prefix / Scan | 51.4% | 50.0% | all |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 50.0% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 50.0% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 50.0% | all |