Is this string a letter doing a cartwheel?

Question

Challenge inspiration was this that I saw somewhere:

The word "nun" is just the letter n doing a cartwheel

Your challenge is to take a string and determine if it is the first letter doing a cartwheel.

Rules

A string is a letter doing a cartwheel if:

• The first letter is the same as the last letter. (The letter can't land on its head.)
• The string alternates between cartwheeling letters every one character.

The cartwheeling letters are n and u, m and w, b and q. Note that n and w together are not cartwheeling letters, and neither are w and b.

• You will take a string using any of our standard input methods.
• You will output a truthy value if the string is a cartwheeling letter, and a falsy value if it is not. Output can be done using any standard output methods.

Additional rules:

• Only lowercase cartwheel letters n/u/m/w/b/q need to be handled.
• You may assume that input is never empty.
• A one-character string is not a valid cartwheel.

Test cases

Input        -> Output
nun          -> truthy
nunun        -> truthy
nunununu     -> falsy
wmw          -> truthy
wmwun        -> falsy
bqbqbqbqbqb  -> truthy
v^v^v        -> falsy
AVAVA        -> falsy
OOO          -> falsy
ununununu    -> truthy
nunwmwnun    -> falsy
nun unun     -> falsy
nunwmw       -> falsy
nnuunnuunnuu -> falsy
nwnwnwnwn    -> falsy
m            -> falsy
nunuuunun    -> falsy

Winner

As with code-golf, the shortest code (in each language) wins!

Answer 1

Javascript, 58 bytes

s=>/^((nu)+n|(un)+u|(mw)+m|(wm)+w|(bq)+b|(qb)+q)$/.test(s)

Tests string for all possible cartwheel strings. Port of this Java answer

Answer 2

Japt, 28 bytes

`wmq¿n`pw ò øU¯2)«(U+g1)rU¯2

Test it online!

Explanation

`wmq¿n` pw ò øU¯  2)«  (U+ g1)rU¯  2
"wmqbun"pw ò øUs0,2)&&!(U+Ug1)rUs0,2
                                       Implicit: U = input string
"wmqbun"                               Take this string.      "wmqbun"
        pw                             Append its reverse.    "wmqbunnubqmw"
           ò                           Form into groups of 2. ["wm","qb","un","nu","nq","mw"]
             ø     )                   Check whether this contains
              Us0,2                      the first two chars of U.
                        U+             Take U and append
                       (  Ug1)           the second char of U.
                              r        Remove all copies of
                               Us0,2     the first two chars of U.
                                       This returns "" iff U has the pattern "xyxyxyx".
                      !                Take the logical NOT: true iff the result is "".
                    &&                 Return whether both of these conditions are true.
                                       Implicit: output result of last expression

Answer 3

C (gcc), 91 90 bytes

Fixed to support strings longer than 255 bytes, which also saves a byte.

f(i){char*s=i,*p=strchr("nunmwmbqb",*s);for(i=0;p&&*s;p=p[i++%2]^*s++?0:p);i=i^1&&i&1&&p;}

Try it online!

Answer 4

Japt, 20 bytes

Êu *`q¿nwm`pÔò d@¥îX

Try it

Êu *`...`pÔò d@¥îX     :Implicit input of string U
Ê                      :Length
 u                     :Mod 2
   *                   :Times
    `...`              :  Compressed string "wbunwm"
         p             :  Append
          Ô            :    Reverse
           ò           :  Partitions of length 2
             d         :  Any true
              @        :  When passed through the following function as X
               ¥       :    Test U for equality with
                îX     :    X repeated and sliced to length of U