Largest Continuous Sequence Zero Sum

Asked in:
Microsoft

Problem Description

Given an array A of N integers.

Find the largest continuous sequence in a array which sums to zero.

Problem Constraints

1 <= N <= 10⁶

-10⁷ <= A[i] <= 10⁷

Input Format

Single argument which is an integer array A.

Output Format

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.

Example Input

A = [1,2,-2,4,-4]

Example Output

[2,-2,4,-4]

Example Explanation

[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.

Start solving Largest Continuous Sequence Zero Sum on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Microsoft

Largest Continuous Sequence Zero Sum

Discussion