Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Find Subsequence of Length K With the Largest Sum
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Length of Longest Subarray With at Most K Frequency
Coding
- Maximum Length of Repeated Subarray
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Oracle
Leetcode 1708. Largest Subarray Length K
Reported Jul 22, 2026 · 1 source report
PRINCIPAL
Source snapshot: Nov 12, 2026
View source