Netflix·Software Engineer·Technical Phone Screen
May 2026
Netflix coding round, one meaty algorithmic problem about finding pairs of users with overlapping watch histories. The problem had a follow-up asking about efficiency at scale, which is where things got interesting.
- You have a dictionary mapping user IDs to their ordered movie-watching histories. Given integers K and M, find all pairs of distinct users whose most recent K movies share at least M movies in common. Design an efficient algorithm and analyze its time and space complexity.
“The naive approach is obvious: for each user grab their last K movies as a set, then do pairwise intersections across all users.” The rest of the author's notes on Software Engineer interview at Netflix, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post