Leetcode 1708. Largest Subarray Length K

Given an array and integer k, find the contiguous subarray of length k that maximizes a specified metric (commonly the sum); this is an easy sliding-window problem where you update the window incrementally to find the optimal subarray in linear time.