080-sliding-window-problem-8.md

Sliding-window Problem 8

LeetCode: https://leetcode.com/problems/maximum-average-subarray-i/ Difficulty: Medium

Problem

Solve this sliding-window problem efficiently.

Brute Force Approach

function solve(nums) {
    let result = [];
    // Check all possibilities
    for (let i = 0; i < nums.length; i++) {
        for (let j = i + 1; j < nums.length; j++) {
            // Process pairs
            if (/* condition */) {
                result.push([i, j]);
            }
        }
    }
    return result;
}

⏱️ Time: O(n²) or O(n³)
💾 Space: O(n)

Optimal Approach

function solve(nums) {
    const map = new Map();
    const result = [];
    
    for (let i = 0; i < nums.length; i++) {
        // Use hash map for O(1) lookup
        const complement = target - nums[i];
        if (map.has(complement)) {
            result.push([map.get(complement), i]);
        }
        map.set(nums[i], i);
    }
    return result;
}

⏱️ Time: O(n) or O(n log n)
💾 Space: O(n) or O(1)

Visual Diagram

Array: [a,b,c,d,e,f]
Window size k=3:

[a b c] d e f
 ↑   ↑
 L   R

a [b c d] e f
   ↑   ↑
   L   R

---

Visit LeetCode for full problem description.