Leetcode 325. Maximum Size Subarray Sum Equals k

Find the length of the longest contiguous subarray whose elements sum to k. Because the array can contain negatives (so two-pointer sliding window fails), this is typically solved in O(n) using prefix sums and a hashmap to record earliest prefix-sum indices.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 325. Maximum Size Subarray Sum Equals k

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact