If a word conforms to a special rule, I call it a Rainbow Word™. The ones given here are particularly strong examples, to help you out, and while the order of Rainbow Words™ doesn't matter at all for the rule, I put these examples in a special order for you!
Use the examples below to find the rule:
|Rainbow Words ™
|Not Rainbow Words ™
And, in CSV form:
Rainbow Word™,Not Rainbow Word™
Each word can be tested for whether it is a Rainbow Word™ without relying on the other words. These are not the only examples of Rainbow Words™; many more exist.
What is the special rule these words conform to?
Hint to start you off:
I'm a programmer, so a required step should be done the "programmer way."
Another hint (Day 2):
Lots of references to colors in this puzzle, aren't there? How do computers display colors?