Software Engineer · Phone Screen · Coding

Netflix — Software Engineer ✅ Passed

Level: Mid-Level

Round: Phone Screen · Type: Coding · Difficulty: 6/10 · Duration: 60 min · Interviewer: Neutral

Topics: Cache, TreeMap, Data Structures, Algorithms

Location: Los Gatos, CA

Interview date: 2025-02-15

Summary

I implemented a weighted cache with get and put operations. The cache has a total weight limit. When the limit is reached, the key-value pair with the largest weight is removed.

Details

The coding question I received was:

Implement a weighted cache with the following requirements:

• Implement get and put operations.
• The cache has a total weight limit.
• When the limit is reached, the key-value pair with the largest weight should be removed.

My approach: I used a TreeMap to ensure both get and put operations have a time complexity of O(logN).

Key Insight: The interviewer appreciated my solution, noting that many candidates use a heap, which results in O(N) complexity.