Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEAI also got different results .I'm glad it wasn't just me.
Nice Challenge. Added an optional RegEx Tokenize method to count the number of words.
スポイラAn interesting one! and we all love Michael. Just noticed my answer is slightly different from the output.
Here is my solution!
Interesting challenge, definitely difficult to not "meta-game" this one and manually search for all the possible typos.
I went for a generic regular expression to find all instances where all the characters in "michael" appeared in a the [Character] string and each only appeared once in that string.
Regular Expression:
REGEX_Match([character], "^(?=(?:[^m]*m){0,2}[^m]*$)(?=(?:[^i]*i){0,2}[^i]*$)(?=[^c]*c?[^c]*$)(?=[^h]*h?[^h]*$)(?=[^a]*a?[^a]*$)(?=[^e]*e?[^e]*$)(?=[^l]*l?[^l]*$)[michael]+$")
Here is my solution - didn't use a join.