How should I practice Sliding Window Maximum?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon onsite interview problems in FastPrep.

Is Sliding Window Maximum associated with Amazon?

FastPrep tags this as a Amazon onsite interview coding practice problem when the problem catalog has that company and stage context.

FastPrepSliding Window Maximum

Problem · Array

Sliding Window Maximum

● Hard

AmazonNEW GRADONSITE INTERVIEW

See Amazon hiring insights

Problem statement

The problem statement continues

Pro

Examples

Example 1

nums = [1,3,-1,-3,5,3,6,7]k = 3return = [3,3,5,5,6,7]

FastPrep Pro

Reported in 1 Amazon interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
1 more worked example, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

CodePython 3

import heapq
from collections import defaultdict
 
class Solution:
    def solve(self, values, queries):
        # Build the adjacency structure
        n = len(values)
        graph = defaultdict(list)
        for u, v in queries:
            graph[u].append(v)
 
        best = [float("inf")] * n
        heap = [(0, 0)]
        while heap:
            cost, node = heapq.heappop(heap)
            if cost > best[node]:
                continue

Run and Submit unlock with Pro