Advent of Code is back! Unwrap daily challenges to sharpen your Alteryx skills and earn badges along the way! Learn more now.
Community is experiencing an influx of spam. As we work toward a solution, please use the 'Notify Moderator' option on the ellipsis menu to flag inappropriate posts.
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
App:
Spoiler
Check if the number is prime number, if not, run the 2 macros parallelly to find previous and next prime number.
Macros:
Spoiler
The 2 iterative macros are similar, just the difference in finding previous/ next number
I wasted so much time in simplifying the app and macros 😑 - just realize it is better to get the result first.
Spoiler
Very Fun Challenge.
Logic was to go with nested iterative macro. The inner macro takes a given number and divides it by all numbers less than selected number. Then checks the mod value for all of these. If only two records have mod of 0 the number is prime.
I wrapped the logic in an iterative macro that said if the information returned indicated the number was not prime - run it again with the number + or - 1 (so two different iterative macros one going up one going down).
Finally did a join multiple to the original number and checked for the closest prime number.
Logic was to go with nested iterative macro. The inner macro takes a given number and divides it by all numbers less than selected number. Then checks the mod value for all of these. If only two records have mod of 0 the number is prime.
I wrapped the logic in an iterative macro that said if the information returned indicated the number was not prime - run it again with the number + or - 1 (so two different iterative macros one going up one going down).
Finally did a join multiple to the original number and checked for the closest prime number.
