Media.net SDE-1 OA 2024 | High-Load Content Delivery Window & Counting Unique Shortest Telemetry Paths

Problem 1 - High-Load Content Delivery Window Problem Statement An ad-tech delivery node processes a sequential stream of incoming server request loads represented as an integer array loads of size N. To configure a localized traffic cache, engineering wants to select a contiguous segment of requests. However, the cache buffer enforces a strict safety criteria: the segment can contain at most K high-load requests. A request is classified as high-load if: loads[i] % 2 != 0 Find the maximum sum ...