func setIntersect(a, b []string) (filtered, removed []string) {
	for _, elemA := range a {
		found := false
		for _, elemB := range b {
			if elemA == elemB {
				found = true
				break
			}
		}
		if found {
			filtered = append(filtered, elemA)
		} else {
			removed = append(removed, elemA)
		}
	}
	return
}
func setIntersect(a, b []string) (filtered, removed []string) {
	for _, elemA := range a {
		found := false
		for _, elemB := range b {
			if elemA == elemB {
				found = true
				break
			}
		}
		if found {
			filtered = append(filtered, elemA)
		} else {
			removed = append(removed, elemA)
		}
	}
	return
}
func setIntersect ( a , b [ ] string ) ( filtered , removed [ ] string ) { for _ , elemA := range a { found := false for _ , elemB := range b { if elemA == elemB { found = true break } } if found { filtered = append ( filtered , elemA ) } else { removed = append ( removed , elemA ) } } return }
// setIntersect removes any elements from the first list that are not in the second, returning the
// new set and the removed elements.
setIntersect removes any elements from the first list that are not in the second returning the new set and the removed elements .