Merge branch 'main' of github.com:UPstartDeveloper/Python-Literacy-Project

Author: UPstartDeveloper

chapter0-exercises/chapter_0_part1.ipynb

@@ -64,7 +64,7 @@
         "assert sys.version_info >= (3, 5)"
       ],
       "id": "DYxtfmnM4caC",
-      "execution_count": 1,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -1402,9 +1402,7 @@
         "\n",
         "The definition of the mode is the *most commonly occurring value* or feature across our data.\n",
         "\n",
-        "**Hint**: think about how you would solve this problem without code. You will probably need to keep track of the number of times each unique element appears in `data`. How might you use a *histogram* to help you achieve this?\n",
-        "\n",
-        "[TODO] add diagram of a histogram"
+        "**Hint**: think about how you would solve this problem without code. You will probably need to keep track of the number of times each unique element appears in `data`. How might you use a *histogram* to help you achieve this?"
       ],
       "id": "dietary-skating"
     },
@@ -1537,10 +1535,11 @@
       "source": [
         "### Solution 2: Using a `Counter`\n",
         "\n",
+        "Using the `dict` type is to compute histograms in Python - so often in fact, that the creators of the language decided to also create the `Counter` type.\n",
         "\n",
-        "TODO: add explanation\n",
+        "Simply put, `Counter` is just a child of the `dict` type with some extra properties. These properties simplify several operations that we typically perform on histograms.\n",
         "\n",
-        "[Python documentation](https://docs.python.org/3/library/collections.html#collections.Counter.most_common)\n"
+        "For example, let's see how we can find the mode of `dataset` by instantiating a `Counter` object, and then using the `most_commmon()` method:\n"
       ],
       "id": "28BJ_7PZbhEy"
     },
@@ -1552,7 +1551,6 @@
       "source": [
         "from collections import Counter\n",
         "\n",
-        "\n",
         "def compute_mode_2(dataset):\n",
         "  # A: compute the histogram\n",
         "  histogram = Counter(dataset)\n",
@@ -1561,9 +1559,19 @@
         "  return mode_value"
       ],
       "id": "V5AGm-fgdOmE",
-      "execution_count": null,
+      "execution_count": 1,
       "outputs": []
     },
+    {
+      "cell_type": "markdown",
+      "metadata": {
+        "id": "_b6Q_jTh2iHI"
+      },
+      "source": [
+        "For more on the properties of the `Counter`, please visit the [Python documentation](https://docs.python.org/3/library/collections.html#collections.Counter)."
+      ],
+      "id": "_b6Q_jTh2iHI"
+    },
     {
       "cell_type": "markdown",
       "metadata": {
@@ -1621,10 +1629,11 @@
       },
       "source": [
         "### Example Input\n",
+        "To wrap your head around technical questions like this, it often helps to just ignore all the verbiage - and create an analogy that helps you understand it clearly.\n",
         "\n",
-        "TODO: add scoreboard analogy?\n",
+        "For example, consider the values in `nums` like the scores of different players on an old, arcade video game machine. And let `k` represent the top highest scores in this game. Now, how would you go about building a scoreboard for this machine (such as shown below) with the top `k` scores listed at the top?\n",
         "\n",
-        "Example:\n",
+        "Use this example input to guide your thinking:\n",
         "\n",
         "```\n",
         "Inputs:\n",
@@ -2335,10 +2344,12 @@
         "\n",
         "You are given a list of numbers, `nums`, and another integer, `target`. How would you implement Python code to find all the pairs of numbers found in `nums` that sum to `target`?\n",
         "\n",
+        "Please return a 2D list of the pairs you find.\n",
+        "\n",
         "You may assume that:\n",
         "\n",
-        "1. `nums` contains at least 2 integers, is unsorted, and contains no duplicate elements.\n",
-        "2. You may return a 2D list of the pairs you find.\n",
+        "1. `nums` contains at least 2 integers.\n",
+        "2. `nums` is unsorted.\n",
         "3. The ordering of the elements in each pair does not matter."
       ],
       "id": "alternate-trust"
@@ -2363,7 +2374,7 @@
         "nums = [3, 5, 2, -4, 8, 11]"
       ],
       "id": "7jAsV3CgVmeQ",
-      "execution_count": 2,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2400,7 +2411,7 @@
         "    return pairs"
       ],
       "id": "guided-kuwait",
-      "execution_count": 4,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",
@@ -2434,7 +2445,7 @@
         "print(find_sum_pairs_1(target, nums))"
       ],
       "id": "VwYRUIPtVwrp",
-      "execution_count": 5,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",
@@ -2476,7 +2487,7 @@
         "    return pairs"
       ],
       "id": "TLb7wYxS5Ujg",
-      "execution_count": 10,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2502,7 +2513,7 @@
         "print(find_sum_pairs_2(target, nums))"
       ],
       "id": "A7fGWqGBV4FQ",
-      "execution_count": 11,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",
@@ -2567,7 +2578,7 @@
         "end = [4, 5, 7, 10]"
       ],
       "id": "gFas01LmjvpS",
-      "execution_count": 12,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2603,7 +2614,7 @@
         "    return max(num_patients)"
       ],
       "id": "first-hacker",
-      "execution_count": 15,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2629,7 +2640,7 @@
         "print(find_max_num_patients_1(start, end))"
       ],
       "id": "Iv7Sw8PTj3kq",
-      "execution_count": 16,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",
@@ -2676,7 +2687,7 @@
         "    return max_patient_count"
       ],
       "id": "vtujB3xpTzAW",
-      "execution_count": 17,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2702,7 +2713,7 @@
         "print(find_max_num_patients_2(start, end))"
       ],
       "id": "T3a3surzkKyh",
-      "execution_count": 18,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",
@@ -2755,7 +2766,7 @@
         "    return max_patient_count\n"
       ],
       "id": "CSstcxCQewSl",
-      "execution_count": 19,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2781,7 +2792,7 @@
         "print(find_max_num_patients_3(start, end))"
       ],
       "id": "DyRTM1k_kZ_s",
-      "execution_count": 20,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",
@@ -2802,9 +2813,7 @@
         "\n",
         "You are given a list of numbers, `nums`, and are asked to divide it into a certain number of partitions, `n_parts`.\n",
         "\n",
-        "How would you implement Python code to perform this task?\n",
-        "\n",
-        "TODO: should the reader assume we have to return a `list` data type?"
+        "How would you implement Python code to perform this task?"
       ],
       "id": "nonprofit-sigma"
     },
@@ -2816,7 +2825,7 @@
       "source": [
         "### Example Input\n",
         "\n",
-        "You may assume `n_parts` is a nonnegative integer. For simplicity, don't worry about which elements go in which partition."
+        "You may assume `n_parts` is a positive integer. For simplicity, don't worry about which elements go in which partition."
       ],
       "id": "lqoRQjGclmiH"
     },
@@ -2830,7 +2839,7 @@
         "n_parts = 2"
       ],
       "id": "lXWGM8i_l6Mc",
-      "execution_count": 21,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2859,7 +2868,7 @@
         "    ]"
       ],
       "id": "cathedral-maple",
-      "execution_count": 22,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2885,7 +2894,7 @@
         "print(partition_1(nums, n_parts))"
       ],
       "id": "C6tY9jwQmGHG",
-      "execution_count": 23,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",
@@ -2923,7 +2932,7 @@
         "    return [list(part) for part in reshaped_array]"
       ],
       "id": "cpqBscYECoYx",
-      "execution_count": 24,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -2959,7 +2968,7 @@
         "print(partition_1(nums, n_parts))"
       ],
       "id": "FBeyCa7EmLpW",
-      "execution_count": 25,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",
@@ -3018,7 +3027,7 @@
         "threshold = 0.5"
       ],
       "id": "religious-cooking",
-      "execution_count": 26,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -3044,7 +3053,7 @@
         "                print((element, index_row, index_element)) "
       ],
       "id": "distributed-emission",
-      "execution_count": 27,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -3060,7 +3069,7 @@
         "index_cosine_matrix(matrix, threshold)"
       ],
       "id": "hired-nickel",
-      "execution_count": 28,
+      "execution_count": null,
       "outputs": [
         {
           "output_type": "stream",