Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.
Jobra drops you into a broken repo. Find it, fix it, ship it. AI helps you debug like on the job.
Mode: On-Campus Exam Pattern: 4 coding OA Date: 2026-11-15
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. Constraints:
3 <= nums.length <= 3000 -105 <= nums[i] <= 105
LPL Finance • 112 views