Coach note
Coding questions test whether you can carry a problem from a vague spec to a working solution while talking through your decisions. Interviewers watch the process at least as much as the answer.
Coding · Algorithms
Given a list of time intervals representing busy periods for N people, find all time slots where everyone is free for at least K minutes. Optimize for the common case where most intervals don't overlap.
Type your answer
0of ~150 wordsAbout a minute spoken
Voice isn’t supported in this browser — type your answer in the box.
Create a free account to get more critiques.
Your answer appears here as you speak.