Alteryx Academy

Hi Maveryx,   A solution to last week’s challenge can be found here.    This challenge was submitted by @AkimasaKajitani . Thanks Aki for this great contribution!   You and your friends enjoy high-energy songs. Since your friends know you are skilled at using Alteryx, they have asked you to create a 60-minute playlist using the Optimization tool. This playlist should contain the most popular and energetic songs, each included only once.   Each record in the provided dataset contains the variable (song ID), song name, popularity, level of energy (ranging from 0 to 1, with 0 being less energetic and 1 being more energetic), and song duration. Additionally, you are given the formatted for the B anchor of the Optimization tool. This represents the maximum duration of 3600 seconds, or 60 minutes (rhs).   Your task is to create a maximum 60-minute playlist that maximizes song popularity from the top 100 high-energy songs. Each song should only be included once. Additionally, output the total popularity value of (Objective ).   Summary of Data: You are provided with a file containing a song popularity dataset with energy values for each song and its duration. Additionally, you are given the formatted input for the B anchor or the Optimization tool.   Hints: Ensure you select Maximize Objective in the Optimization tool settings and spend most of your time structuring the data for the Specify the Model as Matrices option. You will not need to change any other settings in the tool (other than Maximize Objective).   Field names matter! Check out this article, which features data format. song_popularity = coefficient lb and ub values are a binary datatype of 0,1   Need a refresher? Review these resources to gear up: Tool Mastery | Optimization Article: Beginners Guide To Alteryx Optimization Help Documentation: Optimization Tool   Source: The dataset was modified to align with the learning objectives of the challenge. https://www.kaggle.com/datasets/maharshipandya/-spotify-tracks-dataset   Good luck!   ... View more

Hi Maveryx,   A solution to last week’s challenge can be found here.    This week, we are diving deep into the realms of Math and Spatial tools by tackling the creation of Sierpinski’s triangle fractal. This challenge, designed by Roland van Leeuwen @RWvanLeeuwen, is an Expert-level task. If you are preparing for certification and plan to attempt an exam during Inspire, it is an excellent opportunity to hone your skills. Thank you, Roland, for crafting this challenge!   What is a Sierpinski triangle? A Sierpinski triangle is a fractal shape composed of smaller triangles, each a scaled-down replica of the whole. It is created by repeatedly dividing an equilateral triangle into smaller triangles and removing the middle triangle at each iteration. This process results in a geometric pattern that exhibits self-similarity at different scales, forming a visually striking and intricate triangle-based fractal. (This definition is sourced from https://en.wikipedia.org/wiki/Sierpi%C5%84ski_triangle.)   The provided input consists of the of latitude, longitude, and corners a, b, and c.  (The corners are used to determine each point of the triangle.) Your output triangle will look like this:   For this challenge, we are providing additional guidance to simplify the tasks and help you build your Sierpinski’s triangle.   To construct a fractal triangle, follow these steps: Find the corners (points a, b, and c), and any random point within the triangle as a starting point. Select one of the corners of the triangle and form a line from the point to the corner. The center point of the line created is the one we will iterate with. Using the center point of the created line, pick another random corner, draw a line, and find its center. Repeat steps 2 to 4 for 100 iterations. Map all points as green diamonds and the first random centroid as black.       By repeating these steps, a fractal should appear in the shape of Sierpinski's triangle!   If you need a refresher on how to build an iterative macro or create spatial objects, review these lessons in Academy to gear up:   Creating Spatial Objects Creating an Iterative Macro   Good luck!   ... View more

A solution to last week’s challenge can be found here.   The Eurovision Song contest or Eurovision is an annual song competition in Europe.    During a live show, contestants representing European countries, sing a song and receive points. The contestant with the most points wins. In 1974, the Swedish group ABBA became a household name in Europe by winning this contest with the song "Waterloo".   The dataset for this challenge provides information about the Eurovision from 1975 to 2019. The column “Edition” contains a date followed by one or two initials “f” or “fs”. For this challenge, use the values followed by “f”.   Use the dataset to: - Find out which country has won the contest from 1975 to 2019 - List by descending order the countries who have won the most time between these dates   Hint A country cannot give points to its representative. Make sure to take this rule into consideration. Mistakes happen in datasets. ... View more

A solution to last week's challenge can be found here.    This week's challenge was submitted by @wwatson  - Thank you for your submission!   For this week's challenge, you are the skipper of a large container ship destined for Belfast harbour. You must navigate through the exact centre of the navigation channel due to the large draft of your ship. The origin - current position of your ship, the destination and the locations of the channel marker buoys are provided.   Plot the marker buoys as lines showing the left and right buoys, and the route through centre of the buoys. Also calculate the length of the route through the channel from your origin to the destination in miles. Create a report snippet to show the route and distance. ... View more

With another Alteryx Inspire behind us, we wanted to share a workflow from a session in the Community Track: 'Born to Solve - Think Like an Alteryx Champion'   In this session, @patrick_digan presented a analytical challenge to @estherb47  sight-unseen!  The intent of the session was to show more than solving a problem, but show attendees how some of the top challenge leaders approach and think about problems. Would you like to try it yourself? See below!   THE CREW   Challenge Suppose you have 3 ordinary dice (6 sides with the numbers 1-6). You roll all 3 dice and compute the score like so: Multiply the largest number by the second largest number. Then add the remaining number. Given this unique method of scoring, which is the most likely score? ... View more