Given an array A of N integers.
Find the largest continuous sequence in a array which sums to zero.
1 <= N <= 106
-107 <= A[i] <= 107
Single argument which is an integer array A.
Return an array denoting the longest continuous sequence with total sum of zero.
NOTE : If there are multiple correct answers, return the sequence which occurs first in the array.
A = [1,2,-2,4,-4]
[2,-2,4,-4] is the longest sequence with total sum of zero.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.