Leetcode Problem 15. 3Sum

15. 3Sum

Leetcode Solutions

Sort the input array nums.
Iterate through the array with a loop using index i as the fixed pointer.
If the current value is greater than zero, break from the loop as remaining values cannot sum to zero.
If the current value is the same as the one before, skip it to avoid duplicates.
Set the low pointer lo to i + 1, and high pointer hi to the last index.
While lo is smaller than hi, check the sum of nums[i] + nums[lo] + nums[hi].
If the sum is less than zero, increment lo.
If the sum is greater than zero, decrement hi.
If the sum is zero, add the triplet to the result and move both pointers, skipping any duplicate values.
Return the result containing all unique triplets.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen