0
create a golfed down regexp that matches all substrings
inspired by Determine the "Luck" of a string where I found a way to golf almost 30 bytes at once.
The word "lucky" contains 15 different substrings:
lucky
luck, ucky
luc, uck, cky
lu, uc, ck, ky
l, u, c, k, y
Challenge
Create a program...