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.
This is a verified interview question from Lpl-finance. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "3 sum LPL Finance - IIT Hyderabad" covers key patterns like Other.
"**Mode:** On-Campus **Exam Pattern:** 4 coding **OA Date:** 2026-11-15 ## 3 sum 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"
Join thousands of developers practicing for Lpl-finance.