Netflix coding interview
questions, leaked.
38 problems reported across recent Netflix interviews. Top patterns: array, hash table, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Netflix screens for array and hash-table patterns. You have 38 reported problems: 9 easy, 24 medium, 5 hard. Arrays dominate the list (24 problems), followed by hash tables (12) and strings (9). The median difficulty is medium. You'll see interval merging, rate limiting, cache design, and frequency counting. If you blank on a sliding-window or hash-table edge case mid-assessment, StealthCoder runs invisibly and surfaces a working solution in seconds. The interview is built on a narrow set of patterns. Now you have a map.
Top problems at Netflix
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Merge Intervals | MEDIUM | 100.0 | 49% | Array · Sorting |
| 02 | Logger Rate Limiter | EASY | 89.4 | 77% | Hash Table · Design · Data Stream |
| 03 | Meeting Rooms II | MEDIUM | 87.7 | 52% | Array · Two Pointers · Greedy |
| 04 | First Missing Positive | HARD | 87.7 | 41% | Array · Hash Table |
| 05 | Reconstruct Itinerary | HARD | 85.8 | 44% | Depth-First Search · Graph · Eulerian Circuit |
| 06 | Random Pick with Weight | MEDIUM | 81.3 | 48% | Array · Math · Binary Search |
| 07 | Flatten Nested List Iterator | MEDIUM | 75.8 | 65% | Stack · Tree · Depth-First Search |
| 08 | Time Based Key-Value Store | MEDIUM | 75.8 | 49% | Hash Table · String · Binary Search |
| 09 | Summary Ranges | EASY | 72.4 | 53% | Array |
| 10 | Top K Frequent Elements | MEDIUM | 72.4 | 65% | Array · Hash Table · Divide and Conquer |
| 11 | LRU Cache | MEDIUM | 72.4 | 45% | Hash Table · Linked List · Design |
| 12 | Cache With Time Limit | MEDIUM | 68.4 | 76% | |
| 13 | Contains Duplicate III | HARD | 63.5 | 24% | Array · Sliding Window · Sorting |
| 14 | Contains Duplicate II | EASY | 63.5 | 49% | Array · Hash Table · Sliding Window |
| 15 | Longest Substring Without Repeating Characters | MEDIUM | 63.5 | 37% | Hash Table · String · Sliding Window |
| 16 | Koko Eating Bananas | MEDIUM | 57.2 | 49% | Array · Binary Search |
| 17 | Contains Duplicate | EASY | 57.2 | 63% | Array · Hash Table · Sorting |
| 18 | Word Search | MEDIUM | 57.2 | 45% | Array · String · Backtracking |
| 19 | Insert Delete GetRandom O(1) | MEDIUM | 57.2 | 55% | Array · Hash Table · Math |
| 20 | Best Time to Buy and Sell Stock | EASY | 57.2 | 55% | Array · Dynamic Programming |
| 21 | Top K Frequent Words | MEDIUM | 57.2 | 59% | Array · Hash Table · String |
| 22 | Daily Temperatures | MEDIUM | 57.2 | 67% | Array · Stack · Monotonic Stack |
| 23 | Valid Parentheses | EASY | 57.2 | 42% | String · Stack |
| 24 | Search in Rotated Sorted Array | MEDIUM | 57.2 | 43% | Array · Binary Search |
| 25 | Course Schedule II | MEDIUM | 57.2 | 53% | Depth-First Search · Breadth-First Search · Graph |
| 26 | Word Break | MEDIUM | 48.3 | 48% | Array · Hash Table · String |
| 27 | Network Delay Time | MEDIUM | 48.3 | 57% | Depth-First Search · Breadth-First Search · Graph |
| 28 | Implement Queue using Stacks | EASY | 48.3 | 68% | Stack · Design · Queue |
| 29 | Merge Sorted Array | EASY | 48.3 | 53% | Array · Two Pointers · Sorting |
| 30 | To Be Or Not To Be | EASY | 48.3 | 63% | |
| 31 | Minimum Remove to Make Valid Parentheses | MEDIUM | 48.3 | 71% | String · Stack |
| 32 | Rotate Array | MEDIUM | 48.3 | 43% | Array · Math · Two Pointers |
| 33 | Text Justification | HARD | 48.3 | 48% | Array · String · Simulation |
| 34 | Spiral Matrix | MEDIUM | 48.3 | 54% | Array · Matrix · Simulation |
| 35 | Rotate Image | MEDIUM | 48.3 | 78% | Array · Math · Matrix |
| 36 | Number of Flowers in Full Bloom | HARD | 48.3 | 57% | Array · Hash Table · Binary Search |
| 37 | Coin Change | MEDIUM | 48.3 | 46% | Array · Dynamic Programming · Breadth-First Search |
| 38 | Generate Parentheses | MEDIUM | 48.3 | 77% | String · Dynamic Programming · Backtracking |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Netflix OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array24 · 63%
- hash table12 · 32%
- string9 · 24%
- sorting8 · 21%
- design6 · 16%
- binary search5 · 13%
- depth first search5 · 13%
- stack5 · 13%
- heap priority queue4 · 11%
- dynamic programming4 · 11%
Array problems are the throughline: 24 of 38. Expect interval merging (Merge Intervals), duplicate detection (Contains Duplicate II, III), and positional reasoning (First Missing Positive). Hash tables appear in 12 problems, often paired with arrays or design (Logger Rate Limiter, LRU Cache, Top K Frequent Elements). Strings show up in 9, mostly in sliding-window contexts (Longest Substring Without Repeating Characters). Sorting, design, and binary search are secondary. Your week: spend 60 percent on array patterns (especially two-pointer and greedy interval work), 25 percent on hash-table operations and cache design, and 15 percent on string manipulation. If you haven't touched cache-design problems or rate limiting before, StealthCoder is your safety net on those live. The rest is pattern repetition.
Companies with similar patterns
If you prepped for Netflix, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Netflix.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Netflix interview FAQ
How many array problems should I solve before the Netflix OA?+
Netflix leans heavily on arrays: 24 of 38 total problems. Prioritize interval merging, two-pointer sliding, and greedy ordering. Solve at least 10 distinct array problems, hitting Merge Intervals, First Missing Positive, and Summary Ranges. The rest is variation.
Is hash-table knowledge required for Netflix, or can I skip it?+
No. Hash tables appear in 12 problems, including critical ones like LRU Cache, Logger Rate Limiter, and Top K Frequent Elements. You can't skip design problems. Allocate serious time to hash-table operations and cache semantics.
What should I study first for this interview?+
Start with array patterns. Merge Intervals and meeting-room scheduling problems (which use arrays, sorting, and heaps together) appear frequently. Once you're solid on array manipulation, move to hash-table design (LRU Cache, rate limiting). Strings and binary search are lower frequency.
Are the hard problems worth practicing, or should I focus on medium?+
Medium dominates (24 of 38). Only 5 hard problems reported. Get solid on medium first. If you see First Missing Positive or Contains Duplicate III, they're edge-case heavy but followable. Don't burn time on hard if mediums still trip you up.
What if I hit a design problem I've never seen live?+
Netflix includes design problems like LRU Cache, Logger Rate Limiter, and Cache With Time Limit. If you freeze during the assessment, StealthCoder works invisibly and gives you a working skeleton. But do one full mock of LRU Cache beforehand so you understand the pattern.