Longest Subarray Zero Sum Problem Statement

Given an array of integers arr, determine the length of the longest contiguous subarray that sums to zero.

Input:

N (an integer, the length of the array) arr (list of integers)

Output:

(an integer, the length of the longest subarray with sum zero)

Example:

Input:

6 1 -1 3 2 -2 -3

Output:

5

Explanation:

The longest subarray with sum zero is [1, -1, 3, 2, -2].

Constraints:

0

Question

Given an array of integers arr, determine the length of the longest contiguous subarray that sums to zero.

N (an integer, the length of the array)
arr (list of integers)

(an integer, the length of the longest subarray with sum zero)

6
1 -1 3 2 -2 -3

The longest subarray with sum zero is [1, -1, 3, 2, -2].

Note:

You do not need to print anything, just implement the function to return the result.

Accepted Answer

Find the length of the longest contiguous subarray with zero sum in an array of integers.

Use a hashmap to store the prefix sum and its corresponding index.
Iterate through the array and update the hashmap with the current sum and index.
If the same sum is encountered again, the subarray between the two indices has a sum of zero.