I have a list of objects with data. In order to analyze the data, n amount of properties must match and when they don't match, must be removed. This is regardless of the value of the properties, just that they are equal
For example:
| C1 | C2 | C3 | ... |
|---|---|---|---|
| 1 | bob | 3 | ... |
| 1 | bob | 3 | ... |
| 1 | bill | 3 | ... (this row would be removed) |
| 1 | bob | 10 | ... (this row would be removed) |
| 1 | bob | 3 | ... |
I'm somewhat stuck and keep thinking I need to brute-force this. Is there anything in linq that can help? Self intersections?