Netflix Coding Interview Questions
20 Netflix coding interview problems with full optimal solutions — 2 easy, 13 medium, 5 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Netflix interviewer values, and a FAQ section.
Showing 2 problems of 20
- #94easyfoundational
94. Binary Tree Inorder Traversal
Given the root of a binary tree, return the inorder traversal of its node values. Netflix asks this not for the recursion (everyone gets that) but for the explicit-stack and Morris-traversal follow-ups that signal real tree fluency.
4 free resourcesSolve → - #206easyfoundational
206. Reverse Linked List
Given the head of a singly linked list, reverse the list and return the new head. Netflix asks this on phone screens to confirm you can write both the iterative three-pointer dance and the recursive version cleanly under pressure.
4 free resourcesSolve →