Javascript Solution no map or set   70 ms, 4.1 MB
\nvar intersection = function(nums) {\n     let ref = [...nums[0]]\n     for(let i = 1; i < nums.length; i++){\n         ref = ref.filter(n => nums[i].includes(
```\nvar intersection = function(nums) {\n     let ref = [...nums[0]]\n     for(let i = 1; i < nums.length; i++){\n         ref = ref.filter(n => nums[i].includes(n))\n     }\n    return ref.sort((a,b) => a-b)\n};\n```
['JavaScript']