Implement a JavaScript function called findCommon Elements that accepts multiple arrays as arguments and returns a new array containing only the elements that are present in every input array. ``` // Function signature function findCommonElements(...arrays) { // write your code here } // Example input and output: // Input: findCommonElements([1, 2, 3, 4], [2, 4, 6, 8], [2, 4, 101) // Expected Output: [2, 4] ```

{"ScriptPreparationCode":"// ==== Implementation 1: Your current code ====\r\nfunction findCommonElements_v1(...arrays) {\r\n if (!arrays || !Array.isArray(arrays) || arrays.length === 0) {\r\n return [];\r\n }\r\n\r\n const cleanArrays = arrays.map((arr) =\u003E arr.filter((item) =\u003E !!item));\r\n let common = new Set(cleanArrays[0]);\r\n\r\n for (const arr of cleanArrays.slice(1)) {\r\n let tmpUnique = new Set([...arr]);\r\n for (const item of [...common]) {\r\n if (!tmpUnique.has(item)) {\r\n common.delete(item);\r\n }\r\n }\r\n \r\n if (common.size === 0) break;\r\n }\r\n return [...common];\r\n}\r\n\r\n// ==== Implementation 2 ====\r\nfunction findCommonElements_v2(...arrays) {\r\n if (arrays.length === 0) return [];\r\n return [...arrays.reduce((acc, curr) =\u003E {\r\n const currSet = new Set(curr);\r\n return new Set([...acc].filter(el =\u003E currSet.has(el)));\r\n }, new Set(arrays[0]))];\r\n}\r\n\r\n// ==== Implementation 3 ====\r\nfunction findCommonElements_v3(...arrays) {\r\n if (!arrays || arrays.length === 0) {\r\n return [];\r\n }\r\n const referenceArray = arrays[0];\r\n const otherArrays = arrays.slice(1);\r\n return referenceArray.filter(element =\u003E {\r\n return otherArrays.every(arr =\u003E arr.includes(element));\r\n });\r\n}\r\n\r\n// ==== Implementation 4 ====\r\nfunction findCommonElements_v4(...arrays) {\r\n if (!arrays || !Array.isArray(arrays) || arrays.length === 0) {\r\n return [];\r\n }\r\n let common = new Set(arrays[0]);\r\n for (const arr of arrays.slice(1)) {\r\n let currentSet = new Set(arr);\r\n common = new Set([...common].filter((val) =\u003E currentSet.has(val)));\r\n if (common.size === 0) break;\r\n }\r\n return [...common];\r\n}\r\n\r\n// ==== Implementation 5 ====\r\nfunction findCommonElements_v5(...arrays) {\r\n if (arrays.length === 0) {\r\n return [];\r\n }\r\n\r\n if (arrays.length === 1) {\r\n return Array.from(new Set(arrays[0]));\r\n }\r\n\r\n let commonElements = new Set(arrays[0]);\r\n\r\n for (let i = 1; i \u003C arrays.length; i\u002B\u002B) {\r\n const currentArray = arrays[i];\r\n const newCommonElements = new Set();\r\n\r\n\r\n for (const element of currentArray) {\r\n if (commonElements.has(element)) {\r\n newCommonElements.add(element);\r\n }\r\n }\r\n\r\n commonElements = newCommonElements;\r\n\r\n if (commonElements.size === 0) {\r\n break;\r\n }\r\n }\r\n\r\n return Array.from(commonElements);\r\n}\r\n\r\n// ==== Implementation 6 ====\r\nfunction findCommonElements_v6(...arrays) {\r\n if (!arrays.length) return [];\r\n let common = [...arrays[0]];\r\n for (let i = 1; i \u003C arrays.length; i\u002B\u002B) {\r\n const currentArray = arrays[i];\r\n common = common.filter(element =\u003E \r\n currentArray.includes(element)\r\n );\r\n if (common.length === 0) break;\r\n }\r\n return common;\r\n}\r\n\r\n\r\n// ==== Large test case generator ====\r\nfunction generateLargeTestCases(numArrays, arrayLength, valueRange) {\r\n const cases = [];\r\n for (let i = 0; i \u003C numArrays; i\u002B\u002B) {\r\n const arr = [];\r\n for (let j = 0; j \u003C arrayLength; j\u002B\u002B) {\r\n arr.push(Math.floor(Math.random() * valueRange));\r\n }\r\n cases.push(arr);\r\n }\r\n return cases;\r\n}\r\n\r\n// ==== Test cases ====\r\nconst testCases = [\r\n [[1, 2, 3, 4], [2, 4, 6, 8], [2, 4, 101]],\r\n [[1, 2, 3], [1, 2, 4], [1, 5]],\r\n [[]],\r\n [[\u0027a\u0027, \u0027b\u0027], [\u0027b\u0027, \u0027c\u0027], [\u0027b\u0027, \u0027d\u0027]],\r\n [[1, 2], [3, 4], [5]],\r\n generateLargeTestCases(10, 1000, 2000), // 10 arrays, each with 1000 elements\r\n generateLargeTestCases(5, 5000, 10000), // 5 arrays, each with 5000 elements\r\n generateLargeTestCases(20, 200, 1000), // 20 smaller arrays\r\n generateLargeTestCases(3, 10000, 90000) // huge: 3 arrays with 10k elements\r\n];\r\n\r\n// ==== Wrappers for benchmark ====\r\nfunction runV1() { for (let i = 0; i \u003C testCases.length; i\u002B\u002B) findCommonElements_v1(...testCases[i]); }\r\nfunction runV2() { for (let i = 0; i \u003C testCases.length; i\u002B\u002B) findCommonElements_v2(...testCases[i]); }\r\nfunction runV3() { for (let i = 0; i \u003C testCases.length; i\u002B\u002B) findCommonElements_v3(...testCases[i]); }\r\nfunction runV4() { for (let i = 0; i \u003C testCases.length; i\u002B\u002B) findCommonElements_v4(...testCases[i]); }\r\nfunction runV5() { for (let i = 0; i \u003C testCases.length; i\u002B\u002B) findCommonElements_v5(...testCases[i]); }\r\nfunction runV6() { for (let i = 0; i \u003C testCases.length; i\u002B\u002B) findCommonElements_v6(...testCases[i]); }\r\n","TestCases":[{"Name":"v1 (Mine)","Code":"/*When writing async/deferred tests, use \u0060deferred.resolve()\u0060 to mark test as done*/\r\nrunV1();","IsDeferred":false},{"Name":"v2 (Perplexity)","Code":"runV2();","IsDeferred":false},{"Name":"v3 (Gemini)","Code":"runV3();","IsDeferred":false},{"Name":"v4 (ChatGPT)","Code":"runV4();","IsDeferred":false},{"Name":"v5 (Khoj)","Code":"runV5();","IsDeferred":false},{"Name":"v6 (Phind)","Code":"runV6()","IsDeferred":false}]}