I've been researching for quite some time now but can't seem to find how to do this properly. I have a List that consists of a sum of 113287 sub-lists, that each hold 2 integers with 2-3 digits each.
list = [[123, 456], [111, 111], [222, 222], [333, 333], [123, 456], [222, 222], [123, 456]]
Now I want to count the amount of sub-lists, that exist more than once. Not the amount of duplicates overall, also index is irrelevant, I just want to know which combination of values exists more than once.
The result for the example should be "2", since only the sub-lists "[222, 222]" and "[123, 456]" exist more than once.
If possible and only if it doesn't overcomplicate things, I would like to do it without external libraries.
I just can't seem to figure it out, any help is appreciated.