Is there any efficient way to get intersection of two slices in Go?
I want to avoid nested for loop like solutionslice1 := []string{\"foo\", \"bar\",\"hello\"}
https://github.com/viant/toolbox/blob/master/collections.go
Another O(m+n) Time Complexity solution that uses a hashmap. It has two differences compared to the other solutions discussed here.