Software Engineer · Phone Screen · Multiple Types

Netflix — Software Engineer ❌ Failed

Level: Senior-Level

Round: Phone Screen · Type: Multiple Types · Difficulty: 7/10 · Duration: 120 min · Interviewer: Neutral

Topics: Algorithms, Sliding Window, String Manipulation, System Design

Location: Los Angeles, CA, US

Interview date: 2025-12-31

Got offer: False

Summary

Interview Rounds Overview Round 1: Coding Round 2: Problem Solving

Details

I interviewed for a position at Netflix Commerce & Games Engineering. The phone screen consisted of two rounds: a coding round and a problem-solving round.

Coding Round: The interviewer stated this round would be in three parts:

• Part 1: I don't recall the details.
• Part 2: A problem similar to LeetCode 3, solved using the sliding window technique.
• Part 3: Find the number of unique pairs of strings from a list such that the two strings in a pair share no common characters. For example: Input: {“apple”, “banana”, “peach”, “kiwi”} Unique pairs: [apple, kiwi], [peaches, kiwi], [banana, kiwi] The interviewer asked for an O(nlogn) solution, but I could only come up with a brute force approach.

Problem Solving Round: We discussed how to implement viewport rendering on the Netflix home page to ensure that all videos displayed on the home page are unique.

I found this Netflix blog post helpful: https://netflixtechblog.com/lear...mepage-aa8ec670359a

LeetCode similar: LeetCode 3