Learning regex from tutorials never stuck for me, so I made it a game. Each floor shows monsters (strings) — some marked SLAY, some SPARE. You write ONE regex per floor: it must match every SLAY and none of the SPARE. Perfect = descend; a mistake costs a heart. The floors quietly walk you up the whole ladder: literals, ., [classes], ^ $, + * ?, \d{n},(groups|alternation), and a boss email. Try it (no install): npx regex-dungeon Code (MIT): https://github.com/Haneul-two/regex-dungeon Single zero-dependency Node file; floors are just data, so adding your own is a tiny PR. What concept should a floor cover? I'll add the best suggestions.   submitted by   /u/Content_Connection98 [link]   [comments]