๋ฌธ์ ์ ๋ชฉ ์ ๋ต๋ฅ ๋์ด๋ 15. 3sum 32.6% Medium 3Sum - LeetCode Can you solve this real interview question? 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 du leetcode.com ๋ฌธ์ ์์ฝ ์ ์ํ ๋ฐฐ์ด์ด ์ฃผ์ด์ง๋ฉด ํฉ์ด 0์ด ๋๋ 3๊ฐ์ ์ซ์์์ ๋ชจ๋ ๋ฐํํ์ฌ๋ผ ์กฐ๊ฑด 1) ์์๊ฐ 3๊ฐ ์ด์ 1000๊ฐ ์ดํ์ธ ์ ์ํ ๋ฐฐ..