Search
⌘K

Leetcode 1304. Find N Unique Integers Sum up to Zero

Return any array of n distinct integers that sum to zero — the typical approach is to pair opposite numbers and include 0 if n is odd, ensuring uniqueness and O(n) time/space (n ≤ 1000).


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.