[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, (I thought it was the value of nums[i], but it was just index! Don't get confused. Maybe I am the only one confused?) and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. [Solution] Actually, I tried several methods. B..
