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 <= a, b, c, d < n and a, b, c, and d are distinct, and nums[a] +…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.