Challenge #358: Goodbye, Michael! (Part 1)

[ZachBowders]

This was a fun one, I noticed a lot of folks aren't catching the misspellings

[CMeyers]

I also got different results .I'm glad it wasn't just me.

[CMeyers]

[mwinterhack]

Solution (Almost)

[BS_THE_ANALYST]

Nice Challenge. Added an optional RegEx Tokenize method to count the number of words.

Spoiler

[sylviayang]

---

Spoiler

An interesting one! and we all love Michael. Just noticed my answer is slightly different from the output. 

[JereJussila]

Spoiler

Here is my solution!

[becky-pattinson]

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.

Spoiler

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]+$")

[leozhang2work]

Spoiler

[Laurap1228]

Here is my solution - didn't use a join.

Spoiler