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 RoleNestProblem Set
🔥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
Recruiter Fast-Track ReferralVerified Candidate
Direct pipeline to Google, Amazon, Microsoft, Swiggy, & Uber recruiters
Top DevScore profiles bypass resume screening filters. Every verified problem solve writes authentic proof-of-work to your profile and dispatches you directly into employer inboxes on RoleNest.
Explore 5,000+ Direct ATS Openings on RoleNest ↗✓ Direct Referral Active
Language:
Ready to test. Click Run Code or Submit Solution to run test cases in isolated browser sandbox.