Detecting if the ordering is possible

See more:

C++

Java

string

algorithm

We will be given comma separated strings by multiple people. Now those people may not remember all the strings. But whatever order they provide will be correct

For ex :
Person1 : W7, W8, W1, W9
Person2 : W8, W9, W2
Person3 : W2, W10

**Now our role is to detect whether all the above mentioned orders possible**

For ex :
Person1 : W7, W8
Person2 : W8, W9, W10
Person3 : W10, W7

Now the above ordering is not possible because according to person1 - W7 comes before W8. Acc to Person2 : W8 comes before W10. That means W7 comes before W10. But this contradicts with Person3 who says W7 comes after W10


What I want ?

I don't want the code but some help as to how to approach this question

What I have tried:

I thought about it a lot. But frankly was unable to think of a clear solution!

I thought we could maintain a list for each word of the words that come after it and before it. But maintaining and updating such a list is too heavy !