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.
Asked at:
Oracle
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Late July, 2026
Oracle
Principal
Hello Interview Premium
Your account is free and you can post anonymously if you choose.