// Function to find all unique triplets that sum to 0

public List<List<Integer>> threeSum(int[] nums) {

List<List<Integer>> result = new ArrayList<>();

Arrays.sort(nums);

for (int i = 0; i < nums.length - 2; i++) {

if (i > 0 && nums[i] == nums[i - 1]) continue; // skip duplicates

int left = i + 1;

int right = nums.length - 1;

while (left < right) {

int sum = nums[i] + nums[left] + nums[right];

if (sum == 0) {

result.add(Arrays.asList(nums[i], nums[left], nums[right]));

left++;

right--;

// Skip duplicates

while (left < right && nums[left] == nums[left - 1]) left++;

while (left < right && nums[right] == nums[right + 1]) right--;

} else if (sum < 0) {

left++;

} else {

right--;

}

}

}

return result;

}

public static void main(String[] args) {

ThreeSum obj = new ThreeSum();

int[] nums = {-1,0,1,2,-1,-4};

List<List<Integer>> result = obj.threeSum(nums);

System.out.println("Triplets that sum to 0:");

for (List<Integer> triplet : result) {

System.out.println(triplet);

}

}