Subarray Sum Equals 0 (Longest)

Given an integer array *nums*, find the length of the longest subarray whose sum equals 0. If no such subarray exists, return 0.

Input Format

nums = [array of integers]

Output Format

integer (max length of subarray summing to 0)

Constraints

  • 1 <= nums.length <= 10^5; -10^5 <= nums[i] <= 10^5

Examples

Example 1:

Input:

nums = [1,-1,5,-2,3]

Output:

2

Explanation:

Longest zero-sum subarray is [1, -1] of length 2.

Example 2:

Input:

nums = [2,-2,3,1,-4,2,0]

Output:

5

Explanation:

Longest zero-sum subarray is [3,1,-4,2,0] of length 5.

Loading...
Subarray Sum Equals 0 (Longest) - Hashing