Weekly Challenges
Solve the challenge, share your solution and summit the ranks of our Community!Also available in | Français | Português | Español | 日本語
IDEAS WANTED
Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEA
I tried to come up with a solution which was as dynamic as possible and I think I managed to achieve just that.
I spent quite some time wondering why I was getting 25 potential solutions instead of 1, until thankfully I read @dsmdavid comment who also faced the same issue.
On the downside, I had to make a compromise on runtime since for example if words are formed from 8 distinct letters that can take 10 unique values, there are 10^8 different combinations that can occur.
Workflow
Iterative Macro
Wow, interested challenge! Thanks
Spoiler
I used Brute Force and batch macro to solve it. It takes 1h40m lol =))
Definetly not a good way
Definetly not a good way
Well this one was a doozy.
Spoiler
My main goal in this one was to make it flexible (to allow for other verbal arithmetic problems that might vary in length) and to not just throw 71098 tools on the canvas. Both objectives were... challenging. But I'm pleased with the final result!
The general approach I took was to create all the combinations of 8 numbers between 0-9 (since there are only 8 unique letters in the problem), and then use a sweet RegEx approach I developed years ago where you build the RegEx find string and replace string based on the data (allowing for flexibility of length and pattern of letters). Fun to come full circle and re-use something I built for work almost 3 years ago!! If interested in the original use case for dynamic RegEx building, check out A Particularly Problematic Parsing Example example in Use Cases 🙂
Ended up with an iterative macro in this one too, which always gives me that warm & fuzzy feeling... 🙂
Iterates through the combinations of numbers by generating 10 rows of data every time, for numbers 0-9, and then filtering out any values that have already appeared in the combination. Concatenates the new value on to the end of the original combo string, then iterates through again until you reach the desired number of numbers (i.e. unique letters in your problem).
The general approach I took was to create all the combinations of 8 numbers between 0-9 (since there are only 8 unique letters in the problem), and then use a sweet RegEx approach I developed years ago where you build the RegEx find string and replace string based on the data (allowing for flexibility of length and pattern of letters). Fun to come full circle and re-use something I built for work almost 3 years ago!! If interested in the original use case for dynamic RegEx building, check out A Particularly Problematic Parsing Example example in Use Cases 🙂
Ended up with an iterative macro in this one too, which always gives me that warm & fuzzy feeling... 🙂
Iterates through the combinations of numbers by generating 10 rows of data every time, for numbers 0-9, and then filtering out any values that have already appeared in the combination. Concatenates the new value on to the end of the original combo string, then iterates through again until you reach the desired number of numbers (i.e. unique letters in your problem).
Cheers!
NJ
