Is the word typeable with keys adjacent to each other?
Pyth, 66
?&quot;Yes&quot;.Am&gt;2sm^-.uk2Cm.Dx&quot;qwertyuiopasdfghjkl*zxcvbnm&quot;b9.5dC,ztz&quot;No

Try it here.
I was surprised to learn Pyth doesn't have a hypotenuse function, so this will likely be beat by a different language. I'll propose a hypotenuse function to Pyth, so this atrocity won't happen in the future.
Explanation
I transform the keyboard into this:
┌───┬───┬───┬───┬───┬───┬───┬───┬───┬───┐
| Q | W | E | R | T | Y | U | I | O | P |
└─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┐
  | A | S | D | F | G | H | J | K | L | * |
  └─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴─┬─┴───┴───┘
    | Z | X | C | V | B | N | M |
    └───┴───┴───┴───┴───┴───┴───┘

Which I then encode as &quot;qwertyuiopasdfghjkl*zxcvbnm&quot;. Then I used divmod with modulo 9.5 to figure out the 2D coordinates of every key. Then I compute distances between consecutive keys, and check if the squared distance &lt; 2.