A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list.
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.