Loading…
Sliding Window Maximum is a hard coding interview question covering arrays, heap — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
Given an array nums and integer k, return the maximum element in each sliding window of size k as it moves from left to right.
Example: nums=[1,3,-1,-3,5,3,6,7], k=3 -> [3,3,5,5,6,7]
Solve in O(n) time. Naive O(nk) is not acceptable.
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.