Find All Triplets With x Sum: You are given an array Arr consisting of n integers, you need to find all the distinct triplets present in the array which adds up to x. An array is said to have a triplet {arr[i], arr[j], arr[k]} with x sum if there exists three indices i, j and k such that i!=j, j!=k and i!=k and arr[i] + arr[j] + arr[k] = x. Note : 1. You can return the list of values in any order. For example, if (x=0)if a valid triplet is {1, 2, -3}, then (2, -3, 1), (-3, 2, 1) etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order. 2. The elements in the array need not be distinct. 3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".

JS --- 1. obj is passed to fn => when fn is modifying it - how to remove ref 2. spread operator only deep copies 1 layer, how to handle enitre deep copy 3. if we have setTimeout with 0 ms then how will EventLoop handle