Easy Sliding Window Question 27 of 224

How do you compute the average of every contiguous subarray of size k?

DSA interview set · Speak this in 60–90 seconds · Faridabad & Delhi NCR

01234

Index starts at 0. Scan once for max — O(n).

Maintain a running window sum as you slide by one, then divide by k for each position.

Why interviewers care about Sliding Window:

This is a process

question about Sliding Window.

Panels listen for order,

trade-offs, and what you would actually do on a DSA project - not buzzwords.

Stay structured

Name the idea, why it exists, then one short example.

Close cleanly

End with when you use it and one common pitfall.

Before you speak the answer, walk the interviewer through these steps:

1
Maintain a running window
sum as you slide by one, then divide by k for each position.
2
Time is O(n) and
space is O(n-k+1) for the output list.
3
Avoid dividing inside a
hot loop if you only need sums
4
mention floating-point only when
averages are required.
5
Common mistake
What juniors usually get wrong.
6
Close
When you pick this over the alternative.

Here's a short line you can speak, broken into clear beats:

Say this line

“Time is O(n) and space is O(n-k+1) for the output list.”

Break into beats

TimeisOnandspace

Speaking order

2987408337471632900

Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.

Maintain a running window sum as you slide by one, then divide by k for each position. Time is O(n) and space is O(n-k+1) for the output list.