Hello everyone! I am happy for FCC. This is the first time I have posted on the forum.
Good for short: SA = FCC solution; SB = my solution.
SA = / ^ \ D (? = \ w {5}) (? = \ w * \ d {2}) / i
SB = / ^ [a-z] (? = \ w {5,}) \ w * \ d (? = \ d) \ w * /i
The SA is “more elegant” and simple, but SB also solves the problem and meets the condition of “2 positive lookaheads” although the bot evaluates that I do not meet this condition. I do not know why?( This is the only condition that “does not meet”)
I share the link: https://codepen.io/Riac92/pen/jOMBMVZ
If someone can explain me I will be grateful!