You have a list of equations. In each equation you have two operand and one conditional operator. Return `False` if there exist any contrast in the equation of the list otherwise `True`. \n\n```\nInput:\n["a>b", "b>a"]\n["a>b", "b<a", "b>c", "c>a"]\n["a>b", "b<a", "d>c"]\n["Dog>Cat", "Elephant>Dog", "Cat>Elephant"]\n\nOutput:\nFalse \nFalse \nTrue\nFalse\n```\n\n**Constraint:**\n```\n0<=len(list)<=10^5\n1<=operand<=20\nOperator: "<", ">"\n```\n\nI described an way to solve the equation using hashmap. Got an idea to move with topological sort but couldn\'t get any point of view from where i should start. After that i got stucked and I couldn\'t move ahead with any other scope. \n\nCan someone please help me to find out the way to solve?

You have a list of equations. In each equation you have two operand and one conditional operator. Return False if there exist any contrast in the equation of th