Akamai Technologies OA 2026 | Sliding Window Maximum & Minimum Spanning Tree (Kruskal)

Problem 1 - Continuous Data Burst Stream (Sliding Window Maximum) Problem Statement You are given an array bursts representing packet sizes in a network stream and an integer K. A monitoring system continuously evaluates every contiguous window of size K. For each window, determine the maximum packet size present inside that window. Return an array containing the maximum value for every sliding window position. Constraints Constraint 1 ≤ N ≤ 100000 1 ≤ K ≤ N -10000 ≤ bursts[i] ≤ ...