Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEA
Hi Maveryx,
A solution to last week’s challenge can be found here.
It's October, which means another fresh month to dive into the world of learning and problem-solving with Alteryx!
This month is special because we are running a series of four challenges that we selected from a list we've received as a part of our Weekly Challenge User Group October Takeover event. For our first challenge, we chose one received from @gawa, a member of the Tokyo User Group. Thanks, Ippei Nakagawa, for this fantastic contribution!
Most of you are likely familiar with Pokémon, or at the very least, you have come across Pikachu's iconic yellow face at some point! Pokémon are characterized by their unique attributes and moves, grouped in 18 distinct variations known as types. Each Pokémon can be associated with either one or two types. For example, Charmander embodies a singular Type (Fire), whereas Bulbasaur boasts a dual type (Grass and Poison).
For this challenge, you have a comprehensive dataset that contains Pokémon details, including their names, primary type (Type 1), secondary type (Type 2), and additional traits such as speed, generation, and more. Your task is to analyze the types of Pokémon combinations, Type 1 and Type 2, and determine which combinations do not exist in this dataset. For instance, there are no Pokémon in the dataset that have a combination of the Bug and Dark types.
Note: Your output must only include unique combinations, so Type 1: Grass and Type 2: Poison is the same as Type 1: Poison and Type 2: Grass.
Source: https://gist.github.com/armgilles/194bcff35001e7eb53a2a8b441e8b2c6#file-pokemon-csv
Took longer than I wanted, just went simpler/more methodical.
Probably not the most efficient approach
See solution attached.
Solution in the Python Tool,
Seems that I have done it hard way.