🔧 3 and 4 Sum optimized Approach

3 Sum problem(2 pointer approach)
Here,I discussed classic problem of both 3 Sum and 4 Sum problem.
3 Sum Problem
Problem Statement

Find all unique triplets in an array whose sum equals 0.
ex-[-1, 0, 1, 2, -1, -4] o/p-[-1, -1, 2],
[-1, 0, 1]

Approach Using Two Pointers
Step 1 — Sort the Array

Sorting helps:

Use two pointers...