Find N Unique Integers Sum up to Zero Problem

Find N Unique Integers Sum up to Zero Problem — ExecCode Easy DSA Practice

Solve the Find N Unique Integers Sum up to Zero problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer n, return any array containing n unique integers such that they add up to 0.

Examples

Input {"n": 3}; Output [1, -1, 0]. Input {"n": 100}; Output [1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50]. Input {"n": 2}; Output [1, -1]

Constraints

1 <= n <= 1000

Practice Find N Unique Integers Sum up to Zero free on ExecCode. Browse DSA problems, topic map, and placement guides.