diff --git a/1.-Python/1.-Snail-and-Well/snail-and-well-results.ipynb b/1.-Python/1.-Snail-and-Well/snail-and-well-results.ipynb
new file mode 100644
index 000000000..e682c3f49
--- /dev/null
+++ b/1.-Python/1.-Snail-and-Well/snail-and-well-results.ipynb
@@ -0,0 +1,283 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "![](\"https://bit.ly/2VnXWr2\")
"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "# The Snail and the Well\n",
+ "\n",
+ "A snail falls at the bottom of a 125 cm well. Each day the snail rises 30 cm. But at night, while sleeping, slides 20 cm because the walls are wet. How many days does it take for the snail to escape the well?\n",
+ "\n",
+ "**Hint**: The snail gets out of the well when it surpasses the 125cm of height.\n",
+ "\n",
+ "## Tools\n",
+ "\n",
+ "1. Loop: **while**\n",
+ "2. Conditional statements: **if-else**\n",
+ "3. Function: **print()**\n",
+ "\n",
+ "## Tasks\n",
+ "\n",
+ "#### 1. Assign the challenge data to variables with representative names: `well_height`, `daily_distance`, `nightly_distance` and `snail_position`."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 3,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "well_height = 125\n",
+ "daily_distance = 30\n",
+ "nightly_distance = -20\n",
+ "snail_position = daily_distance + nightly_distance\n",
+ "snail_is_in_the_well = True\n",
+ "total_distance = 0"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. Create a variable `days` to keep count of the days that pass until the snail escapes the well. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 4,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "days = 0"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. Find the solution to the challenge using the variables defined above. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 5,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "while snail_is_in_the_well:\n",
+ " total_distance += snail_position\n",
+ " days += 1\n",
+ " if total_distance >= well_height:\n",
+ " snail_is_in_the_well = False"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. Print the solution."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 6,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "The snail needs 13 days to escape the well.\n"
+ ]
+ }
+ ],
+ "source": [
+ "print (\"The snail needs\", days, \"days to escape the well.\")"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "## Bonus\n",
+ "The distance traveled by the snail each day is now defined by a list.\n",
+ "```\n",
+ "advance_cm = [30, 21, 33, 77, 44, 45, 23, 45, 12, 34, 55]\n",
+ "```\n",
+ "On the first day, the snail rises 30cm but during the night it slides 20cm. On the second day, the snail rises 21cm but during the night it slides 20cm, and so on. \n",
+ "\n",
+ "#### 1. How many days does it take for the snail to escape the well?\n",
+ "Follow the same guidelines as in the previous challenge.\n",
+ "\n",
+ "**Hint**: Remember that the snail gets out of the well when it surpasses the 125cm of height."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 6,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "30\n",
+ "31\n",
+ "44\n",
+ "101\n",
+ "125\n",
+ "The snail needs 5 days to escape the well.\n"
+ ]
+ }
+ ],
+ "source": [
+ "well_height = 125\n",
+ "advance_cm = [30, 21, 33, 77, 44, 45, 23, 45, 12, 34, 55]\n",
+ "nightly_distance = -20\n",
+ "snail_position = 0\n",
+ "day = 0\n",
+ "\n",
+ "# snail_position = snail_position + advance_cm[i]\n",
+ "#while snail_position < well_height:\n",
+ "\n",
+ "for i in advance_cm:\n",
+ " day = day + 1\n",
+ " snail_position = snail_position + i\n",
+ " print(snail_position)\n",
+ " if snail_position < well_height:\n",
+ " snail_position = snail_position + nightly_distance\n",
+ " else:\n",
+ " break\n",
+ "print(\"The snail needs\", day, \"days to escape the well.\")"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. What is its maximum displacement in one day? And its minimum? Calculate the displacement using only the travel distance of the days used to get out of the well. \n",
+ "**Hint**: Remember that displacement means the total distance risen taking into account that the snail slides at night. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 3,
+ "metadata": {},
+ "outputs": [
+ {
+ "ename": "NameError",
+ "evalue": "name 'advance_cm' is not defined",
+ "output_type": "error",
+ "traceback": [
+ "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m",
+ "\u001b[1;31mNameError\u001b[0m Traceback (most recent call last)",
+ "\u001b[1;32m\u001b[0m in \u001b[0;36m\u001b[1;34m\u001b[0m\n\u001b[1;32m----> 1\u001b[1;33m \u001b[0mdisplacement\u001b[0m \u001b[1;33m=\u001b[0m \u001b[1;33m[\u001b[0m\u001b[0madvance_cm_item\u001b[0m\u001b[1;33m-\u001b[0m\u001b[1;36m20\u001b[0m \u001b[1;32mfor\u001b[0m \u001b[0madvance_cm_irem\u001b[0m \u001b[1;32min\u001b[0m \u001b[0madvance_cm\u001b[0m\u001b[1;33m]\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m\u001b[0;32m 2\u001b[0m \u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m 3\u001b[0m \u001b[0mprint\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mdisplacement\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m 4\u001b[0m \u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m 5\u001b[0m \u001b[0mprint\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mmax\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mdisplacement\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n",
+ "\u001b[1;31mNameError\u001b[0m: name 'advance_cm' is not defined"
+ ]
+ }
+ ],
+ "source": [
+ "displacement = [advance_cm_item-20 for advance_cm_irem in advance_cm]\n",
+ "\n",
+ "print(displacement)\n",
+ "\n",
+ "print(max(displacement))\n",
+ "\n",
+ "print (min(displacement))"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. What is its average progress? Take into account the snail slides at night."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 4,
+ "metadata": {},
+ "outputs": [
+ {
+ "ename": "NameError",
+ "evalue": "name 'displacement' is not defined",
+ "output_type": "error",
+ "traceback": [
+ "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m",
+ "\u001b[1;31mNameError\u001b[0m Traceback (most recent call last)",
+ "\u001b[1;32m\u001b[0m in \u001b[0;36m\u001b[1;34m\u001b[0m\n\u001b[0;32m 1\u001b[0m \u001b[1;32mimport\u001b[0m \u001b[0mnumpy\u001b[0m \u001b[1;32mas\u001b[0m \u001b[0mnp\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[1;32m----> 2\u001b[1;33m \u001b[0mnp\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mmean\u001b[0m \u001b[1;33m(\u001b[0m\u001b[0mdisplacement\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m\u001b[0;32m 3\u001b[0m \u001b[0mprint\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0msum\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mdisplacement\u001b[0m \u001b[1;33m/\u001b[0m \u001b[0mlen\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mdisplacement\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n",
+ "\u001b[1;31mNameError\u001b[0m: name 'displacement' is not defined"
+ ]
+ }
+ ],
+ "source": [
+ "import numpy as np\n",
+ "np.mean (displacement)\n",
+ "print(sum(displacement / len(displacement)))"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. What is the standard deviation of its displacement? Take into account the snail slides at night."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 5,
+ "metadata": {},
+ "outputs": [
+ {
+ "ename": "NameError",
+ "evalue": "name 'displacement' is not defined",
+ "output_type": "error",
+ "traceback": [
+ "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m",
+ "\u001b[1;31mNameError\u001b[0m Traceback (most recent call last)",
+ "\u001b[1;32m\u001b[0m in \u001b[0;36m\u001b[1;34m\u001b[0m\n\u001b[1;32m----> 1\u001b[1;33m \u001b[0mnp\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0mstd\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mdisplacement\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m",
+ "\u001b[1;31mNameError\u001b[0m: name 'displacement' is not defined"
+ ]
+ }
+ ],
+ "source": [
+ "np.std(displacement)"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "Python 3",
+ "language": "python",
+ "name": "python3"
+ },
+ "language_info": {
+ "codemirror_mode": {
+ "name": "ipython",
+ "version": 3
+ },
+ "file_extension": ".py",
+ "mimetype": "text/x-python",
+ "name": "python",
+ "nbconvert_exporter": "python",
+ "pygments_lexer": "ipython3",
+ "version": "3.8.8"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
diff --git a/1.-Python/1.-Snail-and-Well/snail-and-well.ipynb b/1.-Python/1.-Snail-and-Well/snail-and-well.ipynb
deleted file mode 100644
index 34021448a..000000000
--- a/1.-Python/1.-Snail-and-Well/snail-and-well.ipynb
+++ /dev/null
@@ -1,169 +0,0 @@
-{
- "cells": [
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- ""
- ]
- },
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- "# The Snail and the Well\n",
- "\n",
- "A snail falls at the bottom of a 125 cm well. Each day the snail rises 30 cm. But at night, while sleeping, slides 20 cm because the walls are wet. How many days does it take for the snail to escape the well?\n",
- "\n",
- "**Hint**: The snail gets out of the well when it surpasses the 125cm of height.\n",
- "\n",
- "## Tools\n",
- "\n",
- "1. Loop: **while**\n",
- "2. Conditional statements: **if-else**\n",
- "3. Function: **print()**\n",
- "\n",
- "## Tasks\n",
- "\n",
- "#### 1. Assign the challenge data to variables with representative names: `well_height`, `daily_distance`, `nightly_distance` and `snail_position`."
- ]
- },
- {
- "cell_type": "code",
- "execution_count": null,
- "metadata": {},
- "outputs": [],
- "source": []
- },
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- "#### 2. Create a variable `days` to keep count of the days that pass until the snail escapes the well. "
- ]
- },
- {
- "cell_type": "code",
- "execution_count": null,
- "metadata": {},
- "outputs": [],
- "source": []
- },
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- "#### 3. Find the solution to the challenge using the variables defined above. "
- ]
- },
- {
- "cell_type": "code",
- "execution_count": null,
- "metadata": {},
- "outputs": [],
- "source": []
- },
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- "#### 4. Print the solution."
- ]
- },
- {
- "cell_type": "code",
- "execution_count": null,
- "metadata": {},
- "outputs": [],
- "source": []
- },
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- "## Bonus\n",
- "The distance traveled by the snail each day is now defined by a list.\n",
- "```\n",
- "advance_cm = [30, 21, 33, 77, 44, 45, 23, 45, 12, 34, 55]\n",
- "```\n",
- "On the first day, the snail rises 30cm but during the night it slides 20cm. On the second day, the snail rises 21cm but during the night it slides 20cm, and so on. \n",
- "\n",
- "#### 1. How many days does it take for the snail to escape the well?\n",
- "Follow the same guidelines as in the previous challenge.\n",
- "\n",
- "**Hint**: Remember that the snail gets out of the well when it surpasses the 125cm of height."
- ]
- },
- {
- "cell_type": "code",
- "execution_count": null,
- "metadata": {},
- "outputs": [],
- "source": []
- },
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- "#### 2. What is its maximum displacement in one day? And its minimum? Calculate the displacement using only the travel distance of the days used to get out of the well. \n",
- "**Hint**: Remember that displacement means the total distance risen taking into account that the snail slides at night. "
- ]
- },
- {
- "cell_type": "code",
- "execution_count": null,
- "metadata": {},
- "outputs": [],
- "source": []
- },
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- "#### 3. What is its average progress? Take into account the snail slides at night."
- ]
- },
- {
- "cell_type": "code",
- "execution_count": null,
- "metadata": {},
- "outputs": [],
- "source": []
- },
- {
- "cell_type": "markdown",
- "metadata": {},
- "source": [
- "#### 4. What is the standard deviation of its displacement? Take into account the snail slides at night."
- ]
- },
- {
- "cell_type": "code",
- "execution_count": null,
- "metadata": {},
- "outputs": [],
- "source": []
- }
- ],
- "metadata": {
- "kernelspec": {
- "display_name": "Python 3",
- "language": "python",
- "name": "python3"
- },
- "language_info": {
- "codemirror_mode": {
- "name": "ipython",
- "version": 3
- },
- "file_extension": ".py",
- "mimetype": "text/x-python",
- "name": "python",
- "nbconvert_exporter": "python",
- "pygments_lexer": "ipython3",
- "version": "3.7.2"
- }
- },
- "nbformat": 4,
- "nbformat_minor": 2
-}
diff --git a/1.-Python/2.-Duel-of-Sorcerers/duel-of-sorcerers_results.ipynb b/1.-Python/2.-Duel-of-Sorcerers/duel-of-sorcerers_results.ipynb
new file mode 100644
index 000000000..d91267e3b
--- /dev/null
+++ b/1.-Python/2.-Duel-of-Sorcerers/duel-of-sorcerers_results.ipynb
@@ -0,0 +1,266 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ ""
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "# Duel of Sorcerers\n",
+ "You are witnessing an epic battle between two powerful sorcerers: Gandalf and Saruman. Each sorcerer has 10 spells of variable power in their mind and they are going to throw them one after the other. The winner of the duel will be the one who wins more of those clashes between spells. Spells are represented as a list of 10 integers whose value equals the power of the spell.\n",
+ "```\n",
+ "gandalf = [10, 11, 13, 30, 22, 11, 10, 33, 22, 22]\n",
+ "saruman = [23, 66, 12, 43, 12, 10, 44, 23, 12, 17]\n",
+ "```\n",
+ "For example:\n",
+ "- The first clash is won by Saruman: 10 against 23.\n",
+ "- The second clash is won by Saruman: 11 against 66.\n",
+ "- ...\n",
+ "\n",
+ "You will create two variables, one for each sorcerer, where the sum of clashes won will be stored. Depending on which variable is greater at the end of the duel, you will show one of the following three results on the screen:\n",
+ "* Gandalf wins\n",
+ "* Saruman wins\n",
+ "* Tie\n",
+ "\n",
+ "![](\"images/content_lightning_bolt_big.jpg\")
"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "## Tools\n",
+ "You don't necessarily need to use all the tools. Maybe you opt to use some of them or completely different ones, they are given to help you shape the exercise. Programming exercises can be solved in many different ways.\n",
+ "\n",
+ "1. Data structures: **lists, dictionaries**\n",
+ "2. Loop: **for loop**\n",
+ "3. Conditional statements: **if-elif-else**\n",
+ "4. Functions: **range(), len(), print()**\n",
+ "\n",
+ "## Tasks\n",
+ "\n",
+ "#### 1. Create two variables called `gandalf` and `saruman` and assign them the spell power lists. Create a variable called `spells` to store the number of spells that the sorcerers cast. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 51,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "gandalf = [10, 11, 13, 30, 22, 11, 10, 33, 22, 22]\n",
+ "saruman = [23, 66, 12, 43, 12, 10, 44, 23, 12, 17]\n",
+ "spells = 10"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. Create two variables called `gandalf_wins` and `saruman_wins`. Set both of them to 0. \n",
+ "You will use these variables to count the number of clashes each sorcerer wins. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 52,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "gandalf_wins = 0\n",
+ "saruman_wins = 0\n",
+ "tie = 0 "
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. Using the lists of spells of both sorcerers, update variables `gandalf_wins` and `saruman_wins` to count the number of times each sorcerer wins a clash. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 53,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "for spells in zip(gandalf, saruman):\n",
+ " \n",
+ " gandalf_spell = spells[0]\n",
+ " saruman_spell = spells[1]\n",
+ "\n",
+ " if gandalf_spell>saruman_spell:\n",
+ " gandalf_wins += 1\n",
+ " elif saruman_spell>gandalf_spell:\n",
+ " saruman_wins += 1\n",
+ " elif saruman_spell == gandalf_spell:\n",
+ " gandalf_wins = 0,\n",
+ " saruman_wins = 0"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. Who won the battle?\n",
+ "Print `Gandalf wins`, `Saruman wins` or `Tie` depending on the result. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 54,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "Gandalf won 6 clashes.\n",
+ "Saruman won 4 clashes.\n",
+ "There are 0 Ties.\n",
+ "Gandalf won the battle.\n"
+ ]
+ }
+ ],
+ "source": [
+ "print(\"Gandalf won\", gandalf_wins, \"clashes.\")\n",
+ "print(\"Saruman won\", saruman_wins, \"clashes.\")\n",
+ "print(\"There are\", tie, \"Ties.\")\n",
+ "print (\"Gandalf won the battle.\")"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "## Bonus\n",
+ "\n",
+ "In this bonus challenge, you'll need to check the winner of the battle but this time, a sorcerer wins if he succeeds in winning 3 spell clashes in a row.\n",
+ "\n",
+ "Also, the spells now have a name and there is a dictionary that associates that name to a power.\n",
+ "\n",
+ "```\n",
+ "POWER = {\n",
+ " 'Fireball': 50, \n",
+ " 'Lightning bolt': 40, \n",
+ " 'Magic arrow': 10, \n",
+ " 'Black Tentacles': 25, \n",
+ " 'Contagion': 45\n",
+ "}\n",
+ "\n",
+ "gandalf = ['Fireball', 'Lightning bolt', 'Lightning bolt', 'Magic arrow', 'Fireball', \n",
+ " 'Magic arrow', 'Lightning bolt', 'Fireball', 'Fireball', 'Fireball']\n",
+ "saruman = ['Contagion', 'Contagion', 'Black Tentacles', 'Fireball', 'Black Tentacles', \n",
+ " 'Lightning bolt', 'Magic arrow', 'Contagion', 'Magic arrow', 'Magic arrow']\n",
+ "```\n",
+ "\n",
+ "#### 1. Create variables `POWER`, `gandalf` and `saruman` as seen above. Create a variable called `spells` to store the number of spells that the sorcerers cast. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. Create two variables called `gandalf_wins` and `saruman_wins`. Set both of them to 0. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. Create two variables called `gandalf_power` and `saruman_power` to store the list of spell powers of each sorcerer."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. The battle starts! Using the variables you've created above, code the execution of spell clashes. Remember that a sorcerer wins if he succeeds in winning 3 spell clashes in a row. \n",
+ "If a clash ends up in a tie, the counter of wins in a row is not restarted to 0. Remember to print who is the winner of the battle. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 5. Find the average spell power of Gandalf and Saruman. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 6. Find the standard deviation of the spell power of Gandalf and Saruman. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "Python 3",
+ "language": "python",
+ "name": "python3"
+ },
+ "language_info": {
+ "codemirror_mode": {
+ "name": "ipython",
+ "version": 3
+ },
+ "file_extension": ".py",
+ "mimetype": "text/x-python",
+ "name": "python",
+ "nbconvert_exporter": "python",
+ "pygments_lexer": "ipython3",
+ "version": "3.8.8"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
diff --git a/1.-Python/3.-Bus/bus_results.ipynb b/1.-Python/3.-Bus/bus_results.ipynb
new file mode 100644
index 000000000..823664ba4
--- /dev/null
+++ b/1.-Python/3.-Bus/bus_results.ipynb
@@ -0,0 +1,200 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ ""
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "# Bus\n",
+ "\n",
+ "This bus has a passenger entry and exit control system to monitor the number of occupants it carries and thus detect when there are too many.\n",
+ "\n",
+ "At each stop, the entry and exit of passengers is represented by a tuple consisting of two integer numbers.\n",
+ "```\n",
+ "bus_stop = (in, out)\n",
+ "```\n",
+ "The succession of stops is represented by a list of these tuples.\n",
+ "```\n",
+ "stops = [(in1, out1), (in2, out2), (in3, out3), (in4, out4)]\n",
+ "```\n",
+ "\n",
+ "## Tools\n",
+ "You don't necessarily need to use all the tools. Maybe you opt to use some of them or completely different ones, they are given to help you shape the exercise. Programming exercises can be solved in many different ways.\n",
+ "* Data structures: **lists, tuples**\n",
+ "* Loop: **while/for loops**\n",
+ "* Functions: **min, max, len**\n",
+ "\n",
+ "## Tasks"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 84,
+ "metadata": {
+ "scrolled": true
+ },
+ "outputs": [],
+ "source": [
+ "# Variables\n",
+ "stops = [(10, 0), (4, 1), (3, 5), (3, 4), (5, 1), (1, 5), (5, 8), (4, 6), (2, 3)]"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 1. Calculate the number of stops."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 85,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "The total number of stops is 9\n"
+ ]
+ }
+ ],
+ "source": [
+ "movement = []\n",
+ "occupation = []\n",
+ "total_stops = len(stops)\n",
+ "print(\"The total number of stops is\", total_stops)"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. Assign to a variable a list whose elements are the number of passengers at each stop (in-out).\n",
+ "Each item depends on the previous item in the list + in - out."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 91,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10]]\n",
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13]]\n",
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11]]\n",
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10]]\n",
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14]]\n",
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10]]\n",
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7]]\n",
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5]]\n",
+ "[[10, 10, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4, 10, 13, 11, 10, 14, 10, 7, 5, 4]]\n"
+ ]
+ }
+ ],
+ "source": [
+ "for plus,minus in stops:\n",
+ " movement.append(plus - minus)\n",
+ "\n",
+ "for i in range(total_stops):\n",
+ " occupation.append(sum(movement[0:i+1]))\n",
+ " print ([occupation])"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. Find the maximum occupation of the bus."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 61,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "The maximum occupation of the bus is 14 passengers.\n"
+ ]
+ }
+ ],
+ "source": [
+ "print(\"The maximum occupation of the bus is\", max(occupation), \"passengers.\")"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. Calculate the average occupation. And the standard deviation."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 62,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "The average occupation is 9.33\n",
+ "The standard deviation of the occupation is 3.39\n"
+ ]
+ }
+ ],
+ "source": [
+ "print(\"The average occupation is\",round((sum(occupation)/total_stops),2))\n",
+ "import statistics\n",
+ "print(\"The standard deviation of the occupation is\",round(statistics.stdev(occupation),2))"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "Python 3",
+ "language": "python",
+ "name": "python3"
+ },
+ "language_info": {
+ "codemirror_mode": {
+ "name": "ipython",
+ "version": 3
+ },
+ "file_extension": ".py",
+ "mimetype": "text/x-python",
+ "name": "python",
+ "nbconvert_exporter": "python",
+ "pygments_lexer": "ipython3",
+ "version": "3.8.8"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
diff --git a/1.-Python/4.-Robin-Hood/robin-hood_results.ipynb b/1.-Python/4.-Robin-Hood/robin-hood_results.ipynb
new file mode 100644
index 000000000..20866e568
--- /dev/null
+++ b/1.-Python/4.-Robin-Hood/robin-hood_results.ipynb
@@ -0,0 +1,192 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ ""
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "# Robin Hood\n",
+ "Robin Hood has entered a competition to win the archery contest in Sherwood. With his bow and arrows, he needs to shoot on a target and try to hit as close as possible to the center.\n",
+ "\n",
+ "\n",
+ "\n",
+ "## Context\n",
+ "In this challenge, the landing position of arrows shot by archers in the competition will be represented using 2-dimensional coordinates. \n",
+ "\n",
+ "In the 2-dimensional space, a point can be defined by a pair of values that correspond to the horizontal coordinate (x) and the vertical coordinate (y). For example, in our case, an arrow that hits the center of the archery target will land in position (0, 0) on the coordinate axes. \n",
+ "\n",
+ "The space can be divided into 4 zones (quadrants): Q1, Q2, Q3, Q4. If a point is in Q1, both its x coordinate and y coordinate are positive. Any point with a null x or y coordinate is considered to not belong to any quadrant. \n",
+ "\n",
+ "If you want to know more about the cartesian coordinate system, you can check this [link](https://en.wikipedia.org/wiki/Cartesian_coordinate_system). \n",
+ "\n",
+ "## Tools\n",
+ "You don't necessarily need to use all the tools. Maybe you opt to use some of them or completely different ones, they are given to help you shape the exercise. Programming exercises can be solved in many different ways.\n",
+ "* Data structures: **lists, sets, tuples**\n",
+ "* Conditional statements: **if-elif-else**\n",
+ "* Loop: **while/for**\n",
+ "* Minimum (optional sorting)\n",
+ "\n",
+ "## Tasks\n",
+ "Robin Hood has hit the following points:"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 22,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "points = [(4, 5), (-0, 2), (4, 7), (1, -3), (3, -2), (4, 5), (3, 2), (5, 7), (-5, 7), (2, 2), (-4, 5), (0, -2),\n",
+ " (-4, 7), (-1, 3), (-3, 2), (-4, -5), (-3, 2), (5, 7), (5, 7), (2, 2), (9, 9), (-8, -9)]"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 1. Robin Hood is famous for hitting an arrow with another arrow. Find the coordinates of the points where an arrow hits another arrow."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 23,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "{(4, 5)}\n",
+ "{(4, 5), (5, 7)}\n",
+ "{(4, 5), (5, 7), (2, 2)}\n",
+ "{(-3, 2), (4, 5), (5, 7), (2, 2)}\n",
+ "{(-3, 2), (4, 5), (5, 7), (2, 2)}\n"
+ ]
+ }
+ ],
+ "source": [
+ "double_arrow = []\n",
+ "for i in range(len(points)):\n",
+ " if points[i]in points [i+1:]:\n",
+ " double_arrow.append(points[i])\n",
+ " print(set(double_arrow))"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. Calculate how many arrows have fallen in each quadrant. \n",
+ "**Note**: the arrows that fall in the axis (x=0 or y=0) don't belong to any quadrant."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 24,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "How many arrows have fallen in each quadrant: 10 arrows in Q1, 6 arrows in Q2, 2 arrows in Q3, 2 arrows in Q4.\n"
+ ]
+ }
+ ],
+ "source": [
+ "Q1 = 0\n",
+ "Q2 = 0\n",
+ "Q3 = 0\n",
+ "Q4 = 0\n",
+ "count = 0\n",
+ "\n",
+ "for x in points:\n",
+ " if x[0] > 0 and x[1] > 0:\n",
+ " Q1 += 1\n",
+ " elif x[0] < 0 and x[1] > 0:\n",
+ " Q2 += 1\n",
+ " elif x[0] < 0 and x[1] < 0:\n",
+ " Q3 += 1\n",
+ " elif x[0] > 0 and x[1] < 0:\n",
+ " Q4 += 1\n",
+ "print(\"How many arrows have fallen in each quadrant:\", Q1, \"arrows in Q1,\",Q2, \"arrows in Q2,\",\n",
+ " Q3, \"arrows in Q3,\", Q4, \"arrows in Q4.\")"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. Find the point closest to the center. Calculate its distance to the center. \n",
+ "Take into account that there might be more than one point at the minimum distance to the center.\n",
+ "\n",
+ "**Hint**: Use the Euclidean distance. You can find more information about it [here](https://en.wikipedia.org/wiki/Euclidean_distance). \n",
+ "**Hint**: Defining a function that calculates the distance to the center can help."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 25,
+ "metadata": {},
+ "outputs": [
+ {
+ "ename": "NameError",
+ "evalue": "name 'x1' is not defined",
+ "output_type": "error",
+ "traceback": [
+ "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m",
+ "\u001b[1;31mNameError\u001b[0m Traceback (most recent call last)",
+ "\u001b[1;32m\u001b[0m in \u001b[0;36m\u001b[1;34m\u001b[0m\n\u001b[0;32m 1\u001b[0m \u001b[1;32mimport\u001b[0m \u001b[0mmath\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[1;32m----> 2\u001b[1;33m \u001b[0mdistance\u001b[0m \u001b[1;33m=\u001b[0m \u001b[0mmath\u001b[0m\u001b[1;33m.\u001b[0m\u001b[0msqrt\u001b[0m\u001b[1;33m(\u001b[0m \u001b[1;33m(\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mx1\u001b[0m\u001b[1;33m[\u001b[0m\u001b[1;36m0\u001b[0m\u001b[1;33m]\u001b[0m\u001b[1;33m-\u001b[0m\u001b[0mx2\u001b[0m\u001b[1;33m[\u001b[0m\u001b[1;36m0\u001b[0m\u001b[1;33m]\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m**\u001b[0m\u001b[1;36m2\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m+\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0my1\u001b[0m\u001b[1;33m[\u001b[0m\u001b[1;36m1\u001b[0m\u001b[1;33m]\u001b[0m\u001b[1;33m-\u001b[0m\u001b[0my2\u001b[0m\u001b[1;33m[\u001b[0m\u001b[1;36m1\u001b[0m\u001b[1;33m]\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m**\u001b[0m\u001b[1;36m2\u001b[0m\u001b[1;33m)\u001b[0m \u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m",
+ "\u001b[1;31mNameError\u001b[0m: name 'x1' is not defined"
+ ]
+ }
+ ],
+ "source": [
+ "import math\n",
+ "distance = math.sqrt( ((x1[0]-x2[0])**2)+((y1[1]-y2[1])**2) )"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. If the archery target has a radius of 9, calculate the number of arrows that won't hit the target. \n",
+ "**Hint**: Use the function created in step 3. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "Python 3",
+ "language": "python",
+ "name": "python3"
+ },
+ "language_info": {
+ "codemirror_mode": {
+ "name": "ipython",
+ "version": 3
+ },
+ "file_extension": ".py",
+ "mimetype": "text/x-python",
+ "name": "python",
+ "nbconvert_exporter": "python",
+ "pygments_lexer": "ipython3",
+ "version": "3.8.8"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
diff --git a/1.-Python/5.-Temperature-Processor/temperature_results.ipynb b/1.-Python/5.-Temperature-Processor/temperature_results.ipynb
new file mode 100644
index 000000000..bc095857e
--- /dev/null
+++ b/1.-Python/5.-Temperature-Processor/temperature_results.ipynb
@@ -0,0 +1,353 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ ""
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "# Temperature Sensor\n",
+ "\n",
+ "There is a temperature sensor in the processor of your company's server. The company wants to analyze the data provided by the sensor to decide if they should change the cooling system for a better one. As changing the cooling system is expensive and you are an excellent data analyst, you can't make a decision without basis.\n",
+ "\n",
+ "## Tools\n",
+ "You don't necessarily need to use all the tools. Maybe you opt to use some of them or completely different ones, they are given to help you shape the exercise. Programming exercises can be solved in many different ways.\n",
+ "1. Data structures: **lists**\n",
+ "2. Loops: **list comprehension**\n",
+ "3. Functions: **min, max, print, len**\n",
+ "4. Conditional statements: **if-elif-else**\n",
+ "\n",
+ "## Tasks\n",
+ "The temperatures measured throughout the 24 hours of a day are:"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 7,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "temperatures_C = [33, 66, 65, 0, 59, 60, 62, 64, 70, 76, 80, 81, 80, 83, 90, 79, 61, 53, 50, 49, 53, 48, 45, 39]"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "The first element of the list is the temperature at 12am, the second element is the temperature at 1am, and so on. \n",
+ "\n",
+ "The company has decided that if one of the following events occurs, then the cooling system needs to be replaced for a new one to avoid damaging the processor.\n",
+ "* More than 4 temperatures are greater than or equal to 70ºC.\n",
+ "* Any temperature is above 80ºC.\n",
+ "* The average temperature exceeds 65ºC.\n",
+ "\n",
+ "Follow the steps so that you can make the decision.\n",
+ "\n",
+ "#### 1. Find the minimum temperature of the day and store it in a variable."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 10,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "0\n"
+ ]
+ }
+ ],
+ "source": [
+ "min_temperature = min (temperatures_C)\n",
+ "print (min_temperature)"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. Find the maximum temperature of the day and store it in a variable."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 8,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "90\n"
+ ]
+ }
+ ],
+ "source": [
+ "max_temperature = max(temperatures_C)\n",
+ "print(max_temperature)"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. Create a list with the temperatures that are greater than or equal to 70ºC. Store it in a variable."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 15,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "[0, 70]\n",
+ "[0, 70, 76]\n",
+ "[0, 70, 76, 80]\n",
+ "[0, 70, 76, 80, 81]\n",
+ "[0, 70, 76, 80, 81, 80]\n",
+ "[0, 70, 76, 80, 81, 80, 83]\n",
+ "[0, 70, 76, 80, 81, 80, 83, 90]\n",
+ "[0, 70, 76, 80, 81, 80, 83, 90, 79]\n"
+ ]
+ }
+ ],
+ "source": [
+ "temperatures_greater_70C = [0]\n",
+ "\n",
+ "for i in temperatures_C:\n",
+ " if i >=70:\n",
+ " temperatures_greater_70C.append (i)\n",
+ " print (temperatures_greater_70C)"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. Find the average temperature of the day and store it in a variable."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 12,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "60.25\n"
+ ]
+ }
+ ],
+ "source": [
+ "average_temperature = sum(temperatures_C) / len(temperatures_C)\n",
+ "print(average_temperature)"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 5. Imagine that there was a sensor failure at 3am and the data for that specific hour was not recorded. How would you estimate the missing value? Replace the current value of the list at 3am for an estimation. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 19,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "The estimated temperature at 3am was around 62.0 ºC\n"
+ ]
+ }
+ ],
+ "source": [
+ "temperature_3am = (temperatures_C[2]+temperatures_C[4])/2\n",
+ "\n",
+ "print(\"The estimated temperature at 3am was around\",temperature_3am,\"ºC\")"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 6. Bonus: the maintenance staff is from the United States and does not understand the international metric system. Help them by converting the temperatures from Celsius to Fahrenheit.\n",
+ "To know more about temperature conversion check this [link](https://en.wikipedia.org/wiki/Conversion_of_units_of_temperature).\n",
+ "\n",
+ "**Formula**: \n",
+ "\n",
+ "$F = 1.8 * C + 32$"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 7. Make a decision!\n",
+ "Now it's time to make a decision taking into account what you have seen until now. \n",
+ "\n",
+ "Remember that if one of the following events occurs, then the cooling system needs to be replaced for a new one to avoid damaging the processor.\n",
+ "* More than 4 temperatures are greater than or equal to 70ºC.\n",
+ "* Any temperature is above 80ºC.\n",
+ "* The average temperature exceeds 65ºC.\n",
+ "\n",
+ "#### To make your decision, check if any of the three conditions above is met. You might need to use some of the variables you created in steps 1 to 6. Print a message to show if the cooling system needs to be changed or not."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 34,
+ "metadata": {},
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "True\n",
+ "The cooling system needs to be replaced as two conditions for a change have been met.\n"
+ ]
+ }
+ ],
+ "source": [
+ "def cooling_system_needs_change(lst):\n",
+ " \n",
+ " for x in range(len(lst)-4):\n",
+ " if lst[x] >= 70 and lst[x+1] >= 70 and lst[x+2] >= 70 and lst[x+3] >= 70 and lst[x+4] >= 70:\n",
+ " return True\n",
+ " if lst[x] > 80:\n",
+ " return True\n",
+ " if (sum(lst) / len(lst)) > 65:\n",
+ " return True\n",
+ " else:\n",
+ " return False\n",
+ "\n",
+ "print(cooling_system_needs_change(temperatures_C))\n",
+ "print (\"The cooling system needs to be replaced as two conditions for a change have been met.\")"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "## Bonus\n",
+ "\n",
+ "The company has decided that the decision you made is not valid. They want you to analyze the data again but this time, the conditions that need to be met in order to change the cooling system are different.\n",
+ "\n",
+ "This time, if one of the following events occurs, then the cooling system needs to be replaced:\n",
+ "* The temperature is greater than 70ºC during more than 4 consecutive hours.\n",
+ "* Any temperature is above 80ºC.\n",
+ "* The average temperature exceeds 65ºC.\n",
+ "\n",
+ "Follow the steps so that you can make the decision.\n",
+ "\n",
+ "#### 1. Create a list with the hours where the temperature is greater than 70ºC. Store it in a variable."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. Check if the list you created in step 1 has more than 4 consecutive hours. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. Make the decision!\n",
+ "To make your decision, check if any of the three conditions is met. Print a message to show if the cooling system needs to be changed or not."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. Find the average value of the temperature lists (ºC and ºF). What is the relation between both average values?"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 5. Find the standard deviation of the temperature lists (ºC and ºF). What is the relation between both standard deviations?"
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "Python 3",
+ "language": "python",
+ "name": "python3"
+ },
+ "language_info": {
+ "codemirror_mode": {
+ "name": "ipython",
+ "version": 3
+ },
+ "file_extension": ".py",
+ "mimetype": "text/x-python",
+ "name": "python",
+ "nbconvert_exporter": "python",
+ "pygments_lexer": "ipython3",
+ "version": "3.8.8"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
diff --git "a/1.-Python/6.-Rock\342\200\223Paper\342\200\223Scissors/rock-paper-scissors_results.ipynb" "b/1.-Python/6.-Rock\342\200\223Paper\342\200\223Scissors/rock-paper-scissors_results.ipynb"
new file mode 100644
index 000000000..5839955b4
--- /dev/null
+++ "b/1.-Python/6.-Rock\342\200\223Paper\342\200\223Scissors/rock-paper-scissors_results.ipynb"
@@ -0,0 +1,343 @@
+{
+ "cells": [
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ ""
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "# Rock, Paper & Scissors\n",
+ "\n",
+ "Let's play the famous game against our computer. You can check the rules [here](https://en.wikipedia.org/wiki/Rock%E2%80%93paper%E2%80%93scissors). \n",
+ "\n",
+ "## Task\n",
+ "Create a program that imitates the playability of the well known game of rock, paper, scissors. Follow the guidelines provided.\n",
+ "\n",
+ "## Tools\n",
+ "1. Loop: **for/while**\n",
+ "2. Functions: **input(), print()...**\n",
+ "3. Conditional statements: **if, elif, else**\n",
+ "4. Definition of functions. Modular programming\n",
+ "5. Import modules\n",
+ "\n",
+ "**To solve this challenge, the use of functions is recommended.**\n",
+ "\n",
+ "#### 1. Import the choice function of the random module."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 14,
+ "metadata": {},
+ "outputs": [
+ {
+ "data": {
+ "text/plain": [
+ "'paper'"
+ ]
+ },
+ "execution_count": 14,
+ "metadata": {},
+ "output_type": "execute_result"
+ }
+ ],
+ "source": [
+ "import random \n",
+ "\n",
+ "gestures = ['rock', 'paper', 'scissors']\n",
+ "random.choice(gestures)"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 2. Create a list that includes the 3 possible gesture options of the game: 'rock', 'paper' or 'scissors'. Store the list in a variable called `gestures`."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 15,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "gestures = ['rock', 'paper', 'scissors']"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 3. Create a variable called `n_rounds` to store the maximum number of rounds to play in a game. \n",
+ "Remember that the number of rounds must be odd: 1, 3, 5, ..."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 16,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "n_rounds = 3"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 4. Create a variable called `rounds_to_win` to store the number of rounds that a player must win to win the game.\n",
+ "**Hint**: the value stored in `rounds_to_win` depends on the value of `n_rounds`. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 17,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "rounds_to_win = 2"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 5. Create two variables to store the number of rounds that the computer and the player have won. Call these variables `cpu_score` and `player_score`."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 18,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "cpu_score = 0\n",
+ "player_score = 0"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 6. Define a function that randomly returns one of the 3 gesture options.\n",
+ "You will use this function to simulate the gesture choice of the computer. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 19,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "def gesture(lst):\n",
+ " return random.choice(lst)"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 7. Define a function that asks the player which is the gesture he or she wants to show: 'rock', 'paper' or 'scissors'.\n",
+ "The player should only be allowed to choose one of the 3 gesture options. If the player's choice is not rock, paper or scissors, keep asking until it is."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 20,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "def ask_for_gesture():\n",
+ " choice = \"\"\n",
+ " while choice == \"\":\n",
+ " print (\"Your turn:\")\n",
+ " a = input()\n",
+ " if a in gestures:\n",
+ " choice = a\n",
+ " return choice"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 8. Define a function that checks who won a round. \n",
+ "The function should return 0 if there is a tie, 1 if the computer wins and 2 if the player wins."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": 21,
+ "metadata": {},
+ "outputs": [],
+ "source": [
+ "def who_won(gestures):\n",
+ " cpu_choice = gesture(gestures)\n",
+ " player_choice = ask_for_gesture()\n",
+ " \n",
+ " if cpu_choice == player_choice:\n",
+ " result = \"0\"\n",
+ " elif cpu_choice == 'rock':\n",
+ " if player_choice == 'paper':\n",
+ " result = \"2\"\n",
+ " else:\n",
+ " result = \"cpu\"\n",
+ " elif cpu_choice == 'paper':\n",
+ " if player_choice == 'scissors':\n",
+ " result = \"2\"\n",
+ " else:\n",
+ " result = \"1\"\n",
+ " else:\n",
+ " if player_choice == 'rock':\n",
+ " result = \"2\"\n",
+ " else:\n",
+ " result = \"1\"\n",
+ " return [result, cpu_choice, player_choice]"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 9. Define a function that prints the choice of the computer, the choice of the player and a message that announces who won the current round. \n",
+ "You should also use this function to update the variables that count the number of rounds that the computer and the player have won. The score of the winner increases by one point. If there is a tie, the score does not increase."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {
+ "scrolled": true
+ },
+ "outputs": [
+ {
+ "name": "stdout",
+ "output_type": "stream",
+ "text": [
+ "Your turn:\n",
+ "rock\n",
+ "Game number1: CPU:paper - Player:rock. Accumulated results: ['1']\n",
+ "Your turn:\n",
+ "rock\n",
+ "Game number2: CPU:paper - Player:rock. Accumulated results: ['1', '1']\n",
+ "Your turn:\n",
+ "scissors\n",
+ "Game number3: CPU:paper - Player:scissors. Accumulated results: ['1', '1', '2']\n",
+ "Your turn:\n",
+ "paper\n",
+ "Game number4: CPU:scissors - Player:paper. Accumulated results: ['1', '1', '2', '1']\n",
+ "Your turn:\n",
+ "rock\n",
+ "Game number5: CPU:paper - Player:rock. Accumulated results: ['1', '1', '2', '1', '1']\n",
+ "Your turn:\n"
+ ]
+ }
+ ],
+ "source": [
+ "def play_the_game(gestures):\n",
+ " number_games = 0\n",
+ " results_list = []\n",
+ " wins_player = 0\n",
+ " wins_cpu = 0\n",
+ " while (wins_player < 2) and (wins_cpu < 2):\n",
+ " number_games += 1\n",
+ " start = who_won(gestures)\n",
+ " results_list.append(start[0])\n",
+ " print (\"Game number{number_games}: CPU:{choice_cpu} - Player:{choice_player}. Accumulated results: {acumulated_results}\".format(number_games = number_games, choice_cpu = start[1], choice_player = start[2], acumulated_results = results_list))\n",
+ " if start[0] == \"cpu\":\n",
+ " wins_cpu += 1\n",
+ " elif start[0] == \"player\":\n",
+ " wins_player += 1\n",
+ " if wins_player > wins_cpu:\n",
+ " winner = \"cpu\"\n",
+ " elif wins_player == wins_cpu:\n",
+ " winner = \"tie\"\n",
+ " else:\n",
+ " winner = \"cpu\"\n",
+ " return \"{winner} wins this round.\".format(winner = winner)\n",
+ "\n",
+ "print(play_the_game(gestures))"
+ ]
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 10. Now it's time to code the execution of the game using the functions and variables you defined above. \n",
+ "\n",
+ "First, create a loop structure that repeats while no player reaches the minimum score necessary to win and the number of rounds is less than the maximum number of rounds to play in a game. \n",
+ "\n",
+ "Inside the loop, use the functions and variables above to create the execution of a round: ask for the player's choice, generate the random choice of the computer, show the round results, update the scores, etc. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "#### 11. Print the winner of the game based on who won more rounds.\n",
+ "Remember that the game might be tied. "
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ },
+ {
+ "cell_type": "markdown",
+ "metadata": {},
+ "source": [
+ "# Bonus: Rock, Paper, Scissors, Lizard & Spock\n",
+ "\n",
+ "\n",
+ "In this challenge, you need to improve the previous game by adding two new options. To know more about the rules of the improved version of rock, paper, scissors, check this [link](http://www.samkass.com/theories/RPSSL.html). \n",
+ "\n",
+ "In addition, you will also need to improve how the game interacts with the player: the number of rounds to play, which must be an odd number, will be requested to the user until a valid number is entered. Define a new function to make that request.\n",
+ "\n",
+ "**Hint**: Try to reuse the code that you already coded in the previous challenge. If your code is efficient, this bonus will only consist of simple modifications to the original game."
+ ]
+ },
+ {
+ "cell_type": "code",
+ "execution_count": null,
+ "metadata": {},
+ "outputs": [],
+ "source": []
+ }
+ ],
+ "metadata": {
+ "kernelspec": {
+ "display_name": "Python 3",
+ "language": "python",
+ "name": "python3"
+ },
+ "language_info": {
+ "codemirror_mode": {
+ "name": "ipython",
+ "version": 3
+ },
+ "file_extension": ".py",
+ "mimetype": "text/x-python",
+ "name": "python",
+ "nbconvert_exporter": "python",
+ "pygments_lexer": "ipython3",
+ "version": "3.8.8"
+ }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}
diff --git a/2.-Statistics/1.1 practice quiz on sets.PNG b/2.-Statistics/1.1 practice quiz on sets.PNG
new file mode 100644
index 000000000..d526c5741
Binary files /dev/null and b/2.-Statistics/1.1 practice quiz on sets.PNG differ
diff --git a/2.-Statistics/1.2 practice quiz on the number line,....PNG b/2.-Statistics/1.2 practice quiz on the number line,....PNG
new file mode 100644
index 000000000..98dd6eb36
Binary files /dev/null and b/2.-Statistics/1.2 practice quiz on the number line,....PNG differ
diff --git a/2.-Statistics/1.3 practice quiz on simplification rules,....PNG b/2.-Statistics/1.3 practice quiz on simplification rules,....PNG
new file mode 100644
index 000000000..0a53ee4e7
Binary files /dev/null and b/2.-Statistics/1.3 practice quiz on simplification rules,....PNG differ
diff --git a/2.-Statistics/1.4 graded quiz on sets, number line,...PNG b/2.-Statistics/1.4 graded quiz on sets, number line,...PNG
new file mode 100644
index 000000000..0868b8c3a
Binary files /dev/null and b/2.-Statistics/1.4 graded quiz on sets, number line,...PNG differ
diff --git a/2.-Statistics/2.1 practice quiz on the cartesian plane.PNG b/2.-Statistics/2.1 practice quiz on the cartesian plane.PNG
new file mode 100644
index 000000000..e7e75626a
Binary files /dev/null and b/2.-Statistics/2.1 practice quiz on the cartesian plane.PNG differ
diff --git a/2.-Statistics/2.2 practice quiz on types of functions.PNG b/2.-Statistics/2.2 practice quiz on types of functions.PNG
new file mode 100644
index 000000000..7387dd0f2
Binary files /dev/null and b/2.-Statistics/2.2 practice quiz on types of functions.PNG differ
diff --git a/2.-Statistics/2.3 graded quiz on cartesian plane and types of function.PNG b/2.-Statistics/2.3 graded quiz on cartesian plane and types of function.PNG
new file mode 100644
index 000000000..f6a4d0e3a
Binary files /dev/null and b/2.-Statistics/2.3 graded quiz on cartesian plane and types of function.PNG differ
diff --git a/2.-Statistics/3.1 practice quiz on tangent lines to functions.PNG b/2.-Statistics/3.1 practice quiz on tangent lines to functions.PNG
new file mode 100644
index 000000000..7ce06710b
Binary files /dev/null and b/2.-Statistics/3.1 practice quiz on tangent lines to functions.PNG differ
diff --git a/2.-Statistics/3.2 practice quiz on exponents and logarithms.PNG b/2.-Statistics/3.2 practice quiz on exponents and logarithms.PNG
new file mode 100644
index 000000000..72ab562d2
Binary files /dev/null and b/2.-Statistics/3.2 practice quiz on exponents and logarithms.PNG differ
diff --git a/2.-Statistics/3.3 graded quiz on tangent lines to functions,....PNG b/2.-Statistics/3.3 graded quiz on tangent lines to functions,....PNG
new file mode 100644
index 000000000..b43caa2ca
Binary files /dev/null and b/2.-Statistics/3.3 graded quiz on tangent lines to functions,....PNG differ
diff --git a/2.-Statistics/4.1 practice quiz on probability concepts.PNG b/2.-Statistics/4.1 practice quiz on probability concepts.PNG
new file mode 100644
index 000000000..94e16980f
Binary files /dev/null and b/2.-Statistics/4.1 practice quiz on probability concepts.PNG differ
diff --git a/2.-Statistics/4.2 practice quiz on problem solving.PNG b/2.-Statistics/4.2 practice quiz on problem solving.PNG
new file mode 100644
index 000000000..58aa3f4ae
Binary files /dev/null and b/2.-Statistics/4.2 practice quiz on problem solving.PNG differ
diff --git a/2.-Statistics/4.3 practice quiz on bayes theorem and....PNG b/2.-Statistics/4.3 practice quiz on bayes theorem and....PNG
new file mode 100644
index 000000000..5e90e38e1
Binary files /dev/null and b/2.-Statistics/4.3 practice quiz on bayes theorem and....PNG differ
diff --git a/2.-Statistics/4.4 graded quiz probability basic and intermediate.PNG b/2.-Statistics/4.4 graded quiz probability basic and intermediate.PNG
new file mode 100644
index 000000000..3a3716adc
Binary files /dev/null and b/2.-Statistics/4.4 graded quiz probability basic and intermediate.PNG differ
diff --git a/2.-Statistics/5 completed course screen.PNG b/2.-Statistics/5 completed course screen.PNG
new file mode 100644
index 000000000..3f98a3688
Binary files /dev/null and b/2.-Statistics/5 completed course screen.PNG differ
diff --git a/robot.md b/robot.md
new file mode 100644
index 000000000..8b1378917
--- /dev/null
+++ b/robot.md
@@ -0,0 +1 @@
+