/** * Working with slices * * Two unordered slices of any length are given as input. * Write a function that returns their intersection **/

The function takes two slices of integers, creates a hash table for the first slice, then checks the elements of the second slice for presence in the first. The result is a slice with unique elements that appear in both input slices. A map is used for efficient lookup and to exclude duplicates in the result.