ProblemNest
Sign In
You are coding as a Guest. Sign in with Google in 1 tap to save your daily streak, lock in +50 XP & boost your college rank!
Save Streak (1-Tap Google)
9:00 AM Daily Incident ReleaseMaintaining a 7-day streak grants a 2.5× Recruiter Visibility Multiplier on the Recruiter Talent Radar.
Multiplier Ladder:1d: 1.0ו3d: 1.5ו7d: 2.5× MAX
🔥3Sum: Triplet Zero Sum BalanceMedium
DAILY PROBLEM OF THE DAY+50 XP • Daily Streak

Solve today's challenge or tackle one of the 3 Super Hard challenges for +150 XP.

MediumTwo Pointers•Acceptance: 34.1%

3Sum: Triplet Zero Sum Balance

Targeted in FAANG & Tech OA:GoogleAmazonMicrosoft
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
Verified Proof-of-Work ATS PortfolioCryptographic Verification
Export tamper-proof problem verifications to your direct ATS applications
DevScore: Unranked (0/1000)

Every verified problem solve writes authentic cryptographic proof-of-work to your profile. Attach your verified DevScore badge to ATS applications to stand out to engineering hiring teams across 4,000+ verified live tech openings (23,000+ cumulative audited) on RoleNest.

Explore 4,000+ Direct ATS Openings on RoleNest ↗Solve Challenge to Activate Ledger