Optimize Oculus Data Streaming with Bandwidth Constraints
Company: Meta
Role: Data Scientist
Category: Coding & Algorithms
Difficulty: Medium
Interview Round: Onsite
##### Scenario
Algorithmic screening for Meta VR/AR teams covering Oculus data streaming and geometric optimization.
##### Question
Oculus: Given an array frame_sizes and an integer bandwidth_limit, split the array into the fewest contiguous segments so that the sum of each segment ≤ bandwidth_limit. Return that minimum number. Circle: Given n circles on a 1-D line represented by [center, radius], return the minimum number of horizontal arrows needed so that every arrow shot at position p bursts all circles satisfying center-radius ≤ p ≤ center+radius.
##### Hints
Both can be solved with greedy + sorting; think about keeping running sums or end-points.
Quick Answer: This question evaluates a candidate's ability in algorithm design and problem decomposition for array segmentation and interval coverage, focusing on reasoning about cumulative constraints for streaming data and geometric interval intersections.