search

abhilashmnair / HacktoberFest2021

Beginner-friendly repository for Hacktober Fest 2021. Start your contribution to open source through baby steps. 💜
MIT License
30 stars 147 forks source link

3 sum #217

Closed 0xamitdutta closed 3 years ago

0xamitdutta commented 3 years ago

Given an integer array nums the algorithm returns 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.

0xamitdutta commented 3 years ago

Hi. Do you have any idea why the previous commit I made to This PR is also showing here?

After making the 1st PR I created a new branch and made a 2nd PR but the previous commit is still showing here!