부부의 코딩 성장 일기

1. 문제 링크 https://leetcode.com/problems/4sum/description/ 4Sum - LeetCode Can you solve this real interview question? 4Sum - Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: * 0 List[List[int]]: nums.sort() output = [] for i in range(len(nums)-3): if i > 0 and nums[i] == nums[i - 1]: continue # 중복된 값을 건너뛰기 for j in ra..