duplicate removal - Haskell - get items that occur only once -

I am trying to try to create a new list containing only the one-time element. I can not use recursive

This is a small part of a larger function. I am trying to write the function to Im to get the interresx of two sets. Actually I set the set together and then I want to combine with Set B and get rid of all the duplicates in that set.

Thanks

Edit: Example:

/ P>

[1,2,3,3,4,4,5,5] [1,2]

This question was asked earlier and originally You want to calculate the number of elements and group them together and then remove those people with just one number (perhaps using)

Please

view