Is Find N Unique Integers Sum up to Zero easy or hard?

Find N Unique Integers Sum up to Zero is classified as an Easy problem on LeetCode with an acceptance rate around 78%. The challenge mainly checks whether you recognize the symmetric property of integers that cancel each other out.

Find N Unique Integers Sum up to Zero Python/Java solution

In Python or Java, create an array and add symmetric pairs like i and -i while iterating from 1 to n/2. If n is odd, append 0. The implementation requires only a loop and basic array operations, so the code remains concise across languages.

How to solve Find N Unique Integers Sum up to Zero in O(n)?

Iterate from 1 to n/2 and insert both i and -i into the result array. These pairs cancel each other and maintain uniqueness. If n is odd, append 0 at the end. This single pass produces n numbers with total sum zero in linear time.

What is the best approach for Find N Unique Integers Sum up to Zero?

The symmetric pairing approach is the most straightforward solution. Generate pairs like (1, -1), (2, -2), and continue until you fill the array. If n is odd, add 0 as the final element. This guarantees all numbers are unique and the total sum is zero while running in O(n) time.

Is Find N Unique Integers Sum up to Zero asked at Google/Amazon/Meta?

This problem is tagged as an easy array and math question and appears frequently in interview preparation sets. Variations of constructive array problems are commonly asked by companies like Google, Amazon, and Meta to test logical reasoning and basic algorithm design.

What data structure is used in Find N Unique Integers Sum up to Zero?

The solution mainly uses a simple array or list to store the generated integers. The logic relies more on mathematical symmetry than advanced data structures, which keeps the implementation short and efficient.

What is the time complexity of Find N Unique Integers Sum up to Zero?

The optimal construction runs in O(n) time because you generate each element exactly once. Space complexity is also O(n) since the result array must store n integers. No additional data structures or nested loops are required.

Description Hints 2 Solution Video 9:30

1304. Find N Unique Integers Sum up to Zero

Easy78.5% acceptance6 companies

Given an integer n, return any array containing n unique integers such that they add up to 0.

Example 1:

Input: n = 5
Output: [-7,-1,1,3,4]
Explanation: These arrays also are accepted [-5,-1,1,2,3] , [-3,-1,2,-2,4].

Example 2:

Input: n = 3
Output: [-1,0,1]

Example 3:

Input: n = 1
Output: [0]

Constraints:

1 <= n <= 1000

Asked at 6 companies

American Express Microsoft

Google Amazon Bloomberg Meta

Topics

Array Math

Hints open one at a time

Hint 1

Return an array where the values are symmetric. (+x , -x).

Hint 2

If n is odd, append value 0 in your returned array.

9:30

Still stuck?Read 4 approaches, or watch a walkthrough.

Open solution

LanguageLoading editor…

1class Solution:
2    def sumZero(self, n: int) -> List[int]:
3        

Starter codePython 3Spaces: 4

Examples

Case 1Case 2Case 3

Input

Your code is saved on this device.Solution