Very smart solution

genius. Really cool, there is no replace chain like mine)

Beautiful😇

Wow! beautiful, this is so good!

same, I've complicated my code too much with many conditional statements.

So elegant ^_^

It doesn't affect the overall time complexity to search the list for a fixed, finite number of age groups; it's still O(n). A decent compiler ( which Node might not have, but eg. Haskell does ) would optimise that away anyway. Don't optimise prematurely.

Not sure if searching the list for each age group can be considered Best Practice || Clever ...

lol i gotta learn regex

fantastic

This is not a correct answer as it doesn't return false for ages 10,11 and 12. The question asks for teens and up.

Thanks!

Not sure why this was marked as 'best partices'. Regex is quite slow and shouldn't be used for such easy tasks.