3Sum

[iamdestinychild]

Description

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.

Example 1:

Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Explanation:
nums[0] + nums[1] + nums[2] = (-1) + 0 + 1 = 0.
nums[1] + nums[2] + nums[4] = 0 + 1 + (-1) = 0.
nums[0] + nums[3] + nums[4] = (-1) + 2 + (-1) = 0.
The distinct triplets are [-1,0,1] and [-1,-1,2].
Notice that the order of the output and the order of the triplets does not matter.

DSA Problem

Link: 3Sum

[SmashSidak-1508]

Hi @iamdestinychild, Can you please assign this to me. I would like to contribute under Hacktoberfest.

[Dhandeep10]

hey @iamdestinychild can you assign this to me under hacktober fest

[SmashSidak-1508]

Sir @iamdestinychild I have solved this issue kindly assign me this isue

[SmashSidak-1508]

sir @iamdestinychild kindly review and merge sir it will motivate me a lot