Aurora·Software Engineer·Technical Phone Screen
Jun 2026
Aurora coding round, one problem the whole session. It's a sliding window minimum variant but with a twist on the output size that I almost missed entirely.
- Given an array of length n and a window size k, implement a streaming sliding window minimum that outputs n values total. For indices before the window fills, output the running minimum so far. Once the window is full, output the standard sliding window minimum. Solve in O(n).
“I knew the monotonic deque approach for the standard sliding window max/min problem.”