ekke

  (1.005).toFixed(2) // Expected rounding to "1.01"
  "1.00"

First for the novel Cibola Burn, and third for the app Halide.. the middle post seemingly is a reply to an ad of some book series as well :) Or "influencer" paid content != ads?

  class Eel {
      valueOf () { 
          return 'https://imgflip.com/meme/Bad-Joke-Eel';
      }
  }

  const craftCapacity = 331,
        hovercraft = Array.from(Array(craftCapacity), () => new Eel);

A naive strategy where they never die, and hopefully stay in prison for slightly less than a few billion years:

One prisoner is the light-counter (Mr C). Others follow a simple pattern - if the light is off, and they have never turned it on yet, turn it on. If it is already on, or they have already ever turned it on, do nothing.

Mr C enters the room, if the light is on, remembers it, and turns it off.

When Mr C has entered the room 99 times with light on, he can say 'Yes' and they are safe.

This can be optimized. How?

  ^[lwp]|fa|r[ro]|[isytd]l|c$|de

  ^.{5}[^e]?$