> For the complete documentation index, see [llms.txt](https://rachel2011.gitbook.io/leetcode_cc150/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://rachel2011.gitbook.io/leetcode_cc150/array-and-string/subarray-sum.md).

# Subarray Sum

Given an integer array, find a subarray where the sum of numbers is **zero**. Your code should return the index of the first number and the index of the last number.

## Notice

There is at least one subarray that it's sum equals to zero.

**Example**

Given`[-3, 1, 2, -3, 4]`, return`[0, 2]`or`[1, 3]`.