Sliding Window Median of Response Times
Google● HardINTERNONSITE INTERVIEWProblem statement
A stream of integer response times is supplied in arrival order as responseTimes. Given a window size k, return the median of every complete window containing the most recent k response times.
The first output corresponds to responseTimes[0..k - 1]. Each later output removes the oldest value and includes the next arrival.
The problem statement continues
ProExamples
Example 1
responseTimes = [1,3,-1,-3,5,3,6,7]k = 3return = [1.0,-1.0,-1.0,3.0,5.0,6.0]The first sorted window is [-1, 1, 3], whose median is 1. Sliding one position at a time produces the remaining medians.
FastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week