Zero Sum Subarray

Category: Arrays

Difficulty: Medium

Description

You're given a list of integers nums. Write a function that returns a boolean representing whether there exists a zero-sum subarray of nums.

A zero-sum subarray is any subarray where all of the values add up to zero. A subarray is any contiguous section of the array. For the purposes of this problem, a subarray can be as small as one element and as long as the original array.

Sample Input

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

Sample Output

True // The subarray [-5, 2, 3] has a sum of 0

Optimal Space & Time Complexity

O(n) time | O(n) space - where n is the length of nums