okey this is one of the most complicated small problem i ever had:

you have two lists:

h x

1 3

1 6

1 50

2 4

2 50

2 51

2 53

3 2

3 4

How would a module look like that finds out if one of the x at h=1 also exists in one of the x at h=2 and if one of the x at h=2 does also exist at h=3? without iteration of course…

so it should return

0

0

1

1

0

0

0

0

0

because 50 is in h=1 and h=2 and 4 is in h=2 and h=3

so you basically would compare bin1 with bin2 and bin2 with bin3 and so on. but most of the time the bin size is different.

thinking about it for two days now ~ so ideas are welcome!