What's the best way to find intersection in 2 arrays and what algorithmic complexity does each of the ways have?

Question

1)with some

function test(arr1,arr2){
  return arr1.filter(el1=>{
    return arr2.some(el2=>{
      return el2 === el1
    })
  })
}

co