Available question text
Given an array of integers and an integer k, find the maximum possible sum by selecting exactly k elements from either the front or back of the array without skipping elements. Elements can only be picked consecutively from the beginning or end of the array.
Related questions
Continue with questions that share topics or the same question type.
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
Maximum Sum Subarray from Ends
Reported Feb 8, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source