15. 3Sum. Задача из leetcode

https://leetcode.com/problems/3sum/ https://github.com/Garmonik/leetcode/tree/main/0015_3Sum Условие задачи: 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.