Grokking the Coding Interview: Patterns for Coding Questions
Vote

0% completed

​

Solution: Maximum Size Subarray Sum Equals k

Problem Statement

Given an array of integers nums and an integer k, find the length of the longest subarray that sums to k. If no such subarray exists, return 0.

Examples

Example 1:

  • Input: nums = [1, 2, 3, -2, 5], k = 5
  • Output: 2
  • Explanation: The longest subarray with a sum of 5 is [2, 3], which has a length of 2.

Example 2:

  • Input: nums = [-2, -1, 2, 1], k = 1
  • Output: 2
  • Explanation: The longest subarray with a sum of 1 is [-1, 2], which has a length of 2.

Example 3:

  • Input:

.....

.....

.....

Like the course? Get enrolled and start learning!
Rebecca Lau

Rebecca Lau

· 5 months ago

But the cumulative sum isn’t unique right? How do you handle multiple indexes with the same cumulative sum?

Show 1 reply