You’re given an array of rivals:
rivals = ["A", "B", "C"]
And a list of matches between two rivals represented in tuple form:
matches = [("A", "B), ("B", "C")]
Assign a label (either “good” or “bad”) to each rival, so that there is no match where both rivals have the same label.
Initial thoughts on the solution At a first glance, it sounds very similar to the Graph Colouring problem. In fact I believe it is no different from it, although it is a special case of the graph colouring problem with 2 as the number of colours.
I’ve been pondering whether or not a standing desk would add value to my work flow and life. And I finally got the Jarvis Standing Desk for a couple reasons:
It is probably a good investment now with the coronavirus pandemic and the advent of remote work.
I find that I need to stretch and move my body quite frequently.
Many times during the day, I find that I need to do something quick on my computer and I feel like having to sit down for that is slow and inefficient.