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 <= N <= 10^6
• -10^9 <= arr[i] <= 10^9

Note:

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