Netflix Software Engineer Coding & Algorithms Interview Questions
Practice 24 real Coding & Algorithms interview questions for Software Engineer roles at Netflix.
"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"
"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"
"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."
"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."
"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."
"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."
"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."
"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."
"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."
"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."
"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."
"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."
"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."
"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Simulate a TTL Cache with LRU Eviction
Simulate a TTL Cache with LRU Eviction Implement a deterministic simulator for a cache that combines per-key expiration with a fixed-capacity least-re...
Implement ordering and undo executor
The interview included two coding tasks: 1. Dependency ordering: Given a set of tasks and their dependency relationships, return a valid execution ord...
Return the longest contiguous subarray with all distinct values
This question evaluates a candidate's understanding of array-processing algorithms, duplicate detection, and maintaining state to identify the longest...
Implement Caches, Undo, and Traversal
Solve the following coding tasks. For each task, define clean APIs, implement the core logic, and be prepared to explain time and space complexity. Ta...
Compute subtree sums with tree DFS
You are given an undirected tree with n nodes labeled 1..n and n-1 edges. The tree is rooted at node 1. Each node i has an integer value val[i]. Retur...
Find longest run of identical consecutive shows
This question evaluates array-manipulation skills and the ability to identify contiguous runs of equal values, emphasizing algorithmic efficiency and ...
Implement a Versioned Key-Value Store
Design and implement an in-memory versioned key-value store. Requirements: - put(key, value, timestamp): store value for key at the given integer time...
Compute Earliest Completion Times
You are given n tasks numbered from 0 to n - 1. Each task i has a positive duration duration[i]. You are also given a list of prerequisite relationshi...
Design playlist with add/remove/shuffle
This question evaluates data structure design and algorithmic complexity skills, focusing on managing dynamic sets, uniform random selection, and aver...
Implement topological sort from string input
You receive N lines of raw text describing task dependencies, e.g., 'install A after B', 'C->A', 'B before D'. Implement a function that: ( 1) parses ...
Implement Cache, Undo, and DFS
This question evaluates implementation skills in data structures, algorithmic complexity, and state-management patterns by combining a timed in-memory...
Implement TTL Cache and Tree Balance Reporting
Complete both coding tasks. Task A: Time-limited cache Design and implement an in-memory cache where every key expires after a time-to-live duration. ...
Group users by same last K watched movies
You are given a list of users' movie-watching histories. Each user’s history is an ordered list of movie IDs in the order they were watched (earliest ...
Dedupe titles in per-shelf viewport
You are rendering a streaming app home page. - The home page consists of shelves displayed from top to bottom. - Each shelf contains a list of titleId...
Implement weighted-eviction cache
Question Design and implement a weighted cache supporting get(key) and put(key, value, weight) operations. The cache has a total weight limit; when in...
Compute Minimum Task Completion Time
This question evaluates understanding of graph algorithms (topological sort and DFS), dependency scheduling, cycle detection, and critical-path comput...
Solve String Arrays and Row Deduplication
This multi-part question evaluates array and string manipulation skills, deduplication logic and pairwise character comparison, as well as the ability...
Solve sliding-window and disjoint-string-pairs tasks
This question evaluates proficiency in string-processing algorithms, sliding-window techniques, efficient set or bitmask representations, and combinat...
Compute minimum semesters to finish courses
This question evaluates graph theory and scheduling competencies, including dependency resolution, cycle detection in directed graphs, and capacity-co...
Return valid task order from prerequisites
You are given N tasks labeled 0..N-1 and a list of directed dependency pairs [(a,b), ...] meaning task a must be done before task b. 1) Return one val...