(Note: this is an easier spin-off of my previous challenge [Find the Infinity Words!][1], which is a spin-off of my other previous challenge [Find the Swirling Words!][2] :) ) <h3>Definition of a <i>Wavy Word</i>:</h3> 1. If you connect with curves all the characters of a *Wavy Word* on the alphabet (A-Z) you obtain the path of a wave continuously going toward right or toward left and never changing direction, like in the diagrams below. 2. A *Wavy Word* can be: - *Raising* if each consecutive character is at the right (on the alphabet) of the previous one. - *Decreasing* if each consecutive character is at the left (on the alphabet) of the previous one. 2. All the even connection must be down, all the odd connections must be up. 3. You can ignore upper/lowercase or consider/convert all to upper case or all to lower case. 4. The input words are only characters in the alphabet range of A-Z, no spaces, no punctuation, or symbols. 5. If a word has double characters, like "SPOON", you must collapse the doubles to one character: "SPOON" > "SPON" (because if you go from O to O is zero distance). 5. The *Wavy Words* will contain at least 3 distinct characters (even after doubles collapsing). <h3>Here there are some examples:</h3> [![enter image description here][3]][3] <h3>Task:</h3> Write a full program or function that will take a word from standard input and will output if it is a *Wavy Word* or not, and in positive case, output if it is *raising* or *decreasing*. The output can be `True/False/Null`, `2/1/0`, `1/Null/0`, `-1/0/1`, `NO/WR/WD`, etc, you decide how to represent it. <h3>Test cases:</h3> WAVY WORDS: ADEPT, BEGIN, BILL, BOSS, BOOST, CHIMP, KNOW, SPONGE, SPOON, TROLL, WOLF ADEPT > YES > RAISING BEGIN > YES > RAISING BILL > YES > RAISING BOSS > YES > RAISING BOOST > YES > RAISING CHIMP > YES > RAISING KNOW > YES > RAISING SPONGE > YES > DECREASING SPOON > YES > DECREASING TROLL > YES > DECREASING WOLF > YES > DECREASING NOT WAVY WORDS: WATCH, EARTH, NINON, FOO, BAR, WAVE, SELECTION, YES, NO, DEFINITION, WATER, WINE, CODE, AAAHHHH <h3>Rules:</h3> - Shortest code wins. <h3>Optional Task:</h3> Find, as a list, as many *Wavy Words* as you can in an English dictionary, and the longest as well. You can take for example as reference the complete list of English words [here][4]. [1]: http://codegolf.stackexchange.com/questions/96516/find-the-infinity-words [2]: http://codegolf.stackexchange.com/questions/95507/find-the-swirling-words [3]: https://i.sstatic.net/bDWvz.png [4]: https://github.com/dwyl/english-words