← Microsoft questions

Minimum value in every window of size k

Filed under Microsoft

Given an array of integers `nums` and an integer `k`, return an array containing the minimum value in every sliding window of size `k` moving from left to right. The algorithm must run in O(n) total…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.