3Sum equal Zero

Problem:

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, nums = [-1,0,1,2,-1,-4], Output: [[-1,-1,2],[-1,0,1]]

Approach:

This Problem is similar to this problem, again we will solve this problem using the "Two Pointers" method. Just simply we will avoid the duplicates indexes.

Simple Code: