Aurora·Software Engineer·Technical Phone Screen
May 2026
Aurora coding interview, one problem the whole session. It was a twist on a classic sliding window question and I thought I had it until they added the streaming constraint.
- Given an array of length n and a window size k, output a minimum value for every index from 0 to n-1 in a streaming fashion. Before the window fills up, output the running minimum so far. Once full, output the standard sliding window minimum. Solve it in O(n).
“I recognized the sliding window maximum problem immediately and figured the min version would be a straight swap of the comparator.”