Write a program or function that takes in a string of the characters
-=o. where the
.'s always alternate, character to character. The string will have an odd length greater than one and always start and end in one of
Basically, the input will look like a line of emoticon faces that share eyes in various states of sleepiness, e.g.
Your goal is to print or return the face that is either the sleepiest or the most awake (it's up to you which you choose). If there are multiple choices for who is sleepiest/most awake then any one of them may be output.
There are nine distinct faces and five levels of sleepiness:
-.- is 100% sleepy -.= is 75% sleepy -.o is 50% sleepy =.- is 75% sleepy =.= is 50% sleepy =.o is 25% sleepy o.- is 50% sleepy o.= is 25% sleepy o.o is 0% sleepy
In case it's not clear, the sleepiness percentage is computed by assigning
- for fully asleep,
= for half asleep, and
o for awake. Then the sum of the two eye values divided by two is the percentage.
The shortest code in bytes wins.
-.- GIVES -.- =.- GIVES =.- o.o GIVES o.o o.-.= GIVES -.= =.-.= GIVES =.- OR -.= o.-.= GIVES -.= -.-.= GIVES -.- o.o.- GIVES o.- =.=.=.o GIVES =.= -.=.=.= GIVES -.= =.o.-.= GIVES -.= o.-.o.=.= GIVES o.- OR -.o OR =.= -.o.-.=.= GIVES -.= o.o.o.o.o GIVES o.o -.-.-.-.- GIVES -.- o.=.=.-.-.o.o GIVES -.- -.=.-.o.o.=.o.-.o.=.-.o.=.o.- GIVES -.= OR =.-
-.- GIVES -.- =.- GIVES =.- o.o GIVES o.o o.-.= GIVES o.- =.-.= GIVES =.- OR -.= o.-.= GIVES o.- -.-.= GIVES -.= o.o.- GIVES o.o =.=.=.o GIVES =.o -.=.=.= GIVES =.= =.o.-.= GIVES =.o o.-.o.=.= GIVES o.= -.o.-.=.= GIVES -.o OR o.- OR =.= o.o.o.o.o GIVES o.o -.-.-.-.- GIVES -.- o.=.=.-.-.o.o GIVES o.o -.=.-.o.o.=.o.-.o.=.-.o.=.o.- GIVES o.o