ProblemNest
Sign In
You are coding as a Guest. Sign in with your RoleNest account to permanently track your streak, earn XP, and climb the Campus Leaderboard!
Sign In with RoleNest
🔥3Sum: Triplet Zero Sum BalanceMedium
MediumTwo Pointers•Acceptance: 34.1%

3Sum: Triplet Zero Sum Balance

Real-World Engineering Context
Used in financial accounting ledger reconciliation to discover 3-party zero-balance offset loops, and in computational geometry for 3-point collinearity detection.
Given an integer array `nums`, return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`. Notice that the solution set must not contain duplicate triplets.

Sample Test Cases

Input: [[-1,0,1,2,-1,-4]]
Expected: [[-1,-1,2],[-1,0,1]]
Input: [[0,0,0]]
Expected: [[0,0,0]]
Input: [[0,1,1]]
Expected: []

Constraints

  • 3 <= nums.length <= 3000
  • -10^5 <= nums[i] <= 10^5