# Introduction In this challenge, we aim to find distinct triplets in an integer array that sum up to zero. Your objective is to develop a function named `threeSum` that receives an array of integers and verifies the existence of three elements whose sum equals zero. The function must return each unique triplet that fits this criterion. The input array can include repeated elements, but the solution set must not include any duplicate triplets.
Click the virtual machine below to start practicing