Dsa
Intervals
Easy
Contiguous Video Stream
A video player downloads chunks of data as byte ranges [start, end]. The player can only play the video from byte 0 up to the first missing byte. Given N downloaded chunks (which may overlap), find the highest byte index that is playable starting from 0.
Example:
Input: N=3
Chunks: [0, 100], [150, 200], [100, 160]
Merged coverage starting from 0: [0, 200]
Output: 200
Key concepts
intervalsmergingstream processing
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now