Paylocity OA 2025 | Telemetry Data Window Cleansing & Cloud Infrastructure Resource Clusters

Problem 1 - Telemetry Data Window Cleansing Problem Statement You are building an analytics dashboard that tracks background process durations. You are given an array of positive integers logs and an integer K. Your task is to determine the maximum length of a contiguous subarray such that no value appears more than K times within the window. Return the length of the longest valid contiguous window. Constraints Constraint 1 ≤ N ≤ 105 1 ≤ logs[i] ≤ 106 1 ≤ ...