Netflix Interviews · 2

I was asked to implement a TTL cache similar to the leetcode cache problem with the following methods:

set(key, value, duration) : sets a key-value along with it's expiration time

get(key) : returns the value associated with key if it's still valid

count(key) : returns unexpired key count

Follow-up:

There were follow-ups on scaling the cache system to handle scenarios where multiple clients are concurrently reading and writing to the cache, and possible performance optimizations

Tips:

Be sure to cover all possible edge cases and think aloud to clarify any assumptions

Had a quick call with the recruiter to see if I was a good fit, and she went over the role, culture, and relocation.

Spoke with the hiring manager, and we went over the technical skills required for the role (e.g., Java 8, testing frameworks), the team, and the culture. He also discussed the types of projects I can expect to work on.

Had a phone interview and was asked to solve a coding challenge in 45 minutes. The task was to find the split point in a list of integers [0, 0, 1, 0, 1, 0, 0, 0, 0] to maximize the sum of #1's on the left and #0's on the right. The interviewer also asked AWS scaling questions in the last few minutes.