I am making early forays into the application of algorithms to best solve a problem and I am finding it difficult to choose the best application.
The problem is give the data below (two columns) find those ids where the linkedId matches entirely:
id linkedId 1 103 2 107 1 107 2 103 4 64 6 120 7 107 8 180 7 64 9 129
Expected output [1,2] as the linkedIds match entirely for the two ids
As I look at the data, I would envisage a graph of some description so that I can establish the various links between the ids and linkedIds but I am at a loss as to how to approach this.
I do not want a solution but more guiding in the right direction.