3sum in 15mins | leetcode | java

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.

[@toshitgurajala3612]

Jai balayya 🔥🔥🔥

[@miakhalifa9612]

big fan

[@codecorn8030]

😂😂