Available question text
Given an array of integers and a target value K, find a contiguous subarray whose elements sum to K and return the subarray elements in their original order (rather than returning indices or a boolean).
Related questions
Continue with questions that share topics or the same question type.
- 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
- Maximum Size Subarray Sum Equals k
Coding
- Subarray Sum Equals K
Coding · Array · Hash Table · Prefix Sum
- Subarray Sum Equals Target
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 · 2 records
Atlassian
Subarray Sum Equals K (Return the Subarray)
Reported Jul 9, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View sourceWalmart
Subarray Sum Equals K (Return the Subarray)
Reported Jul 17, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source