Netflix Software Engineer Interview Questions

Netflix Software Engineer Screening Question Device Notification Timing

You are given an integer array time of size n, where time[i] represents the time taken by the i-th process to send a notification to a single device. All processes start working simultaneously and ope

netflix fulltime software engineer onsite interview experience

发帖分享光羔组不一样的面经全套攒rp 目前面完两周ghost了 hr无任何消息 可能石沉大海了吧 首先问了能不能面staff但是hr坚决拒绝了说外面的6在这就是5，有机会做6的work的不需要担心哈哈 OA 轮面的是和其他公司差不多的 versioned KV store。面试官人挺好的 感觉在这个domain也很长时间，上来就和我说既然你也是做光羔的不如按照ads data store来做，所以边聊边写，讲了一些我想到的ads的惯常操作，聊的比较开心 code写慢了但还是过了。 OA完两天就通知VO。 VO四轮和地里面经一点不一样： coding可能是最接近面经的 topological sort但是加上了类似dp的constraint需要处理prerequisite啥时候完成。没见过的变体。 这个部分没写对 面试官给了hint我也理解edge case但是没修完bug SD问的也不是freq cap是pacing。这个我了解high lvl所以按照差不多的逻辑回答了 自认有些没有deep dive到的地方吧，比如rate limit具体怎么实现，但是面试官也没有揪着我不放...

netflix software engineer technical phone screen interview experience

Coding 第一题：给一个string array，求最长连续相同子数组 第二题：给一个string array，求最长不包含重复string的子数组 第三题：给一个string array，求所有不包含任何相同字符的string pair。 比如 input: ['a', 'ab', 'b'], output: [[0, 2]] 第三题只写了O(n^2)的解，面试官没有要求优化。后面聊了半个小时的天，聊了很多工作的经历和技术上的一些问题，还有在公司的工作体验。 Problem Solving 第一题：王菲主页，每一行有若干个电影，删掉重复的电影，如果这一行已经有了6个，后面的可以重复 Follow up 1: 每一行去重的阈值是动态的，可以是6个，也可以是任意个 Follow up 2: 只需要去重前N行，后面的可以重复 Follow up 3: 有条件去重，某些比较特殊的行，不需要去重 这个时间有点紧，中间出了一个bug，写了一些test case和log，把bug解决之后差不多时间就到了。确实没有想到有三个follow up。 最终是挂了，整个沟通互动应该...

Netflix Software Engineer Fulltime Tech Phone Screen Experience

Online application -> HR contacted -> Asked about Faye Wong's culture and his proudest project. First round in-store interview -> Implement a key-value pair that can expire -> Follow-up question: How

Movie History Friends II

Movie History Friends II ### The Challenge We have a record of movies watched by different customers. The list for each customer shows the movies in the exact order they watched them. In this proble

Home Page Video Recommendation

Netflix Home Page Video Recommendations ## The Challenge Design a system to recommend videos for the Netflix home page. ## Helpful Learning Materials If you want to learn the details of **ML system

Meeting Rooms

Meeting Rooms ## Problem Requirements You are given a list of meeting time intervals. Each interval has a specific **start** time and **end** time. Your task is to check if a person can attend all t

Design an Ads Audience Targeting System

Design an Ads Audience Targeting System Design a system that lets advertisers upload lists of users. The system must group these users into segments and use them to target ads precisely. The system

Netflix Sentiment Tracking

Netflix Sentiment Tracker ## The Challenge We need to design a system that tracks how people feel about Netflix on social media over time. The system must collect posts, figure out the sentiment (po

Contains Duplicate

Problem Requirements You are given a list of whole numbers called `nums`. Your goal is to check if any number appears more than once in this list. * If any number shows up at least twice, return `tr

Sort by User Preference

Sorting Shows Based on User Preferences ### The Challenge Imagine you have an app that displays a list of TV shows. You need to write a program that sorts these shows based on what a user likes. The

User Engagement Patterns

User Engagement Analysis You need to analyze how users interact with video content. We categorize a user's activity based on the percentage of the video they watched: * **"Abandoned"**: The user wat

Homepage Title Deduplication

Netflix Homepage: Removing Duplicate Titles ### The Scenario Imagine the Netflix homepage. It is structured as a vertical list of rows, which we call **shelves**. Each shelf holds a horizontal list

Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters ### Problem Requirements You are given a string called `s`. Your task is to find the length of the longest substring that contains no duplicate charact

Music Playlist

Problem Requirements We need to build a data structure that keeps a history of songs listened to. Each entry must store the song name and the timestamp when it was played. You need to create a class