Netflix Mobile Engineer Interview Questions

Netflix needs fast access to frequently requested data to enhance user experience by minimizing load times. An LRU (Least Recently Used) Cache is pivotal in achieving this within limited memory.
Design and implement a data structure that retrieves the most recently accessed items while evicting the least recently used ones when the capacity is reached.Method Signature:
- get(key: int) -> int — Retrieves the value of the key if present in the cache, otherwise returns -1.
- put(key: int, value: int) -> void — Updates or inserts the value by key. If the cache is at capacity, it should invalidate the least recently used item before inserting a new item.Example 1:
Input:
put(1, 1)
put(2, 2)
get(1)
put(3, 3)
get(2)
put(4, 4)
get(1)
get(3)
get(4)
Output: 1, -1, 3, 4
Explanation: The cache evicts key 2, then returns the rest correctly.Constraints:
- capacity is always positive.
- The keys and values are within the range of the integer type.

Netflix streams videos to millions of users globally, optimizing for a smooth playback experience even on challenging network conditions. This problem simulates a video buffering engine to efficiently manage the amount of video data loaded into memory.
Given an array of integers representing video segment sizes, determine the maximum number of segments that can be buffered without exceeding a specified memory limit.Method Signature:
- maxBufferedSegments(segmentSizes: List[int], memoryLimit: int) -> int — Returns the maximum number of segments that can be buffered.Example 1:
Input: segmentSizes = [1, 2, 3, 4, 5], memoryLimit = 7
Output: 3
Explanation: Buffer segments of sizes 1, 2, and 3, totaling 6, which is within the memory limit.Constraints:
- 1 <= segmentSizes.length <= 10^5
- 1 <= memoryLimit <= 10^9
- 1 <= segmentSizes[i] <= 10^6