leetcode18

Overview ¶

* @lc app=leetcode id=18 lang=golang * * [18] 4Sum * * https://leetcode.com/problems/4sum/description/ * * algorithms * Medium (32.46%) * Likes: 1544 * Dislikes: 290 * Total Accepted: 298.7K * Total Submissions: 917.2K * Testcase Example: '[1,0,-1,0,-2,2]\n0' * * Given an array nums of n integers and an integer target, are there elements * a, b, c, and d in nums such that a + b + c + d = target? Find all unique * quadruplets in the array which gives the sum of target. * * Note: * * The solution set must not contain duplicate quadruplets. * * Example: * * * Given array nums = [1, 0, -1, 0, -2, 2], and target = 0. * * A solution set is: * [ * ⁠ [-1, 0, 0, 1], * ⁠ [-2, -1, 1, 2], * ⁠ [-2, 0, 0, 2] * ] * *