Simple JS Solution
\tconst intersection = function(nums) {\n\t\tlet map = new Map()\n\t\tlet res = []\n\n\t\tnums.forEach(arr => {\n\t\t\tarr.forEach(num => map.set(num, map.get(n
\tconst intersection = function(nums) {\n\t\tlet map = new Map()\n\t\tlet res = []\n\n\t\tnums.forEach(arr => {\n\t\t\tarr.forEach(num => map.set(num, map.get(num) + 1 || 1))\n\t\t})\n\n\t\tfor(let [key, value] of map) {\n\t\t\tif (value === nums.length) {\n\t\t\t\tres.push(key)\n\t\t\t}\n\t\t}\n\n\t\treturn res.sort((a, b) => a - b)\n\t};
['JavaScript']