<iframe src="https://www.googletagmanager.com/ns.html?id=GTM-KVGHS6G" height="0" width="0" style="display:none;visibility:hidden"></iframe>

Netflix计算机科学面试真题

职位分类
全部
数据相关
计算机科学
人工智能
产品经理
BQ
面试题
全部(44)
OOD(5)
Algorithm(14)
System Design(20)
高频题(0)
Math(0)
全部(44)
OOD(5)
Algorithm(14)
System Design(20)
高频题(0)
Math(0)
1.Count of Smaller Numbers After Self
2.Design a Java class to store and retrieve unique and valid emails from nested data structures.
3.Design a Frequency Cap System for an Ads Platform
4.Design a Topological Sorting Algorithm
5.Schema Design for a Meta-like Product
6.Reporting Aggregation System Design
7.Course Sorting Algorithm
8.Log Output Suppression
9.Bag-of-Words and Cosine Similarity
10.Contact Tracing System Design
11.Commerce Model for Video Content
12.Shortest Path Algorithm
13.Warehouse Shortest Path Data Model
14.Describe a complex system you've recently worked on
15.Adapted LeetCode Problem
16.System Design Evaluation
17.Coding Challenge
18.Compare HTTP1 and HTTP2
19.Implement Notification Alert in React
20.Implement SQS with Dead Letter Queue and Visibility Timeout
21.Design a Notification System
22.Implement a Hash Map
23.Word Search Algorithm
24.Find All Null Paths in a JSON Object
25.Describe the most challenging bug you've encountered and how you resolved it.
26.Describe a project you are most proud of.
27.Render a histogram from a map
28.Convert an array to a map in JavaScript
29.Effects of modifying prototypes in JavaScript
30.Describe JavaScript inheritance
31.Explain JavaScript closures
32.Detailed System Design
33.LRU Cache Variant Problem Solving
34.Concurrency in System Design
35.LeetCode Logistics Problem
36.Determine Interval Overlap
37.Design a Parent and Child Class
38.Scaling BFS for Large Graphs
39.Coding a Time-Based Key-Value Store
40.Optimizing Algorithm for Finding Users with Similar Video History
41.System Design for Free Trial Eligibility Verification
42.Working in Infrastructure
43.Experience with Distributed Systems
44.Implement a Waterfall Layout Photo Wall
1. Count of Smaller Numbers After Self
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].

 

Example 1:

Input: nums = [5,2,6,1]
Output: [2,1,1,0]
Explanation:
To the right of 5 there are 2 smaller elements (2 and 1).
To the right of 2 there is only 1 smaller element (1).
To the right of 6 there is 1 smaller element (1).
To the right of 1 there is 0 smaller element.

Example 2:

Input: nums = [-1]
Output: [0]

Example 3:

Input: nums = [-1,-1]
Output: [0,0]

 

Constraints:

  • 1 <= nums.length <= 105
  • -104 <= nums[i] <= 104
2. Design a Java class to store and retrieve unique and valid emails from nested data structures.
Design a Java class to store and retrieve unique and valid emails from nested data structures. The input data will be in the form of a list with elements like {type: email, value: xxx@xx.com} and nested structures such as {type: contact, value: {type: email, value: xxx@xxx.com}}. Your task is to create a class that can handle this data and provide a function to return the first unique and valid email address.
3. Design a Frequency Cap System for an Ads Platform
Design a frequency cap system for an ads platform to limit the number of times an ad is shown to a user within a certain time frame to ensure a good user experience. Discuss the algorithms and technologies that could be used for rate limiting and ad impression aggregation.
4. Design a Topological Sorting Algorithm
Design a topological sorting algorithm for Netflix's video rendering system, where videos have dependencies on each other. Discuss edge cases and how the algorithm would handle them.
5. Schema Design for a Meta-like Product
In a schema design interview, you are asked to design the API and data relationships for a product similar to Meta. Discuss your design approach based on your work experience and the considerations you take into account when designing the schema.