Add kindergarten-garden (exercism#940)

Author: ahans

config.json

@@ -2,14 +2,14 @@
   "language": "C",
   "slug": "c",
   "active": true,
-  "blurb": "C is a small, general-purpose, imperative programming language with a static type system, scopes, and structures. It's typically used as an alternative to assembly programming, such as in operating systems.",
-  "version": 3,
   "status": {
     "concept_exercises": false,
     "test_runner": true,
     "representer": false,
     "analyzer": false
   },
+  "blurb": "C is a small, general-purpose, imperative programming language with a static type system, scopes, and structures. It's typically used as an alternative to assembly programming, such as in operating systems.",
+  "version": 3,
   "online_editor": {
     "indent_style": "space",
     "indent_size": 4,
@@ -36,7 +36,6 @@
     ]
   },
   "exercises": {
-    "concept": [],
     "practice": [
       {
         "slug": "hello-world",
@@ -1015,6 +1014,14 @@
           "performance_optimizations",
           "strings"
         ]
+      },
+      {
+        "slug": "kindergarten-garden",
+        "name": "Kindergarten Garden",
+        "uuid": "9484317e-d638-4714-afba-2a10baccff16",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 1
       }
     ]
   },
@@ -1024,7 +1031,7 @@
       "slug": "basics",
       "name": "Basics"
     },
-    {    
+    {
       "uuid": "20948c69-20f7-498d-b743-fada00e5c79d",
       "slug": "bits",
       "name": "Bits"
@@ -1043,7 +1050,7 @@
       "uuid": "1721552b-9c55-432d-a776-05e618c25bb4",
       "slug": "function-pointers",
       "name": "Function Pointers"
-    },    
+    },
     {
       "uuid": "e5725455-3ce3-48e9-a3c6-ceb522434b5b",
       "slug": "conditionals",
@@ -1058,7 +1065,7 @@
       "uuid": "e39f5003-8ed9-4d82-ab9b-f79bbca78679",
       "slug": "linkage",
       "name": "Linkage"
-    },    
+    },
     {
       "uuid": "3d79388b-e909-4e1b-99e9-d28e30e54fde",
       "slug": "loops",
@@ -1083,7 +1090,7 @@
       "uuid": "f4946fe8-afb3-4110-8fca-b1476f19be6f",
       "slug": "static-functions",
       "name": "Static Functions"
-    },    
+    },
     {
       "uuid": "c065ddca-627c-45b6-a92f-7144dd852111",
       "slug": "storage-class-specifiers",
@@ -1092,46 +1099,46 @@
   ],
   "key_features": [
     {
-      "icon": "cross-platform",
       "title": "Cross-platform",
-      "content": "C is portable and can run on almost any platform and chipset."
+      "content": "C is portable and can run on almost any platform and chipset.",
+      "icon": "cross-platform"
     },
     {
-      "icon": "general-purpose",
       "title": "General purpose",
-      "content": "Can be used for a wide variety of workloads from IoT to game engines."
+      "content": "Can be used for a wide variety of workloads from IoT to game engines.",
+      "icon": "general-purpose"
     },
     {
-      "icon": "fast",
       "title": "Fast",
-      "content": "Consistently rated as one of the highest performing languages for energy and time."
+      "content": "Consistently rated as one of the highest performing languages for energy and time.",
+      "icon": "fast"
     },
     {
-      "icon": "stable",
       "title": "Stable",
-      "content": "The C standard values stability and backwards compatibility, C programs can run for decades."
+      "content": "The C standard values stability and backwards compatibility, C programs can run for decades.",
+      "icon": "stable"
     },
     {
-      "icon": "powerful",
       "title": "Powerful",
-      "content": "Allows both lower and higher level functionality, making it very powerful."
+      "content": "Allows both lower and higher level functionality, making it very powerful.",
+      "icon": "powerful"
     },
     {
-      "icon": "widely-used",
       "title": "Widely used",
-      "content": "Consistently one of the most popular languages for everything from operating systems to firmware"
+      "content": "Consistently one of the most popular languages for everything from operating systems to firmware",
+      "icon": "widely-used"
     }
   ],
   "tags": [
     "execution_mode/compiled",
     "paradigm/procedural",
-    "typing/static",
     "platform/android",
     "platform/ios",
     "platform/linux",
     "platform/mac",
     "platform/windows",
     "runtime/language_specific",
+    "typing/static",
     "used_for/backends",
     "used_for/cross_platform_development",
     "used_for/embedded_systems",

exercises/practice/kindergarten-garden/.docs/instructions.md

@@ -0,0 +1,58 @@
+# Instructions
+
+Given a diagram, determine which plants each child in the kindergarten class is
+responsible for.
+
+The kindergarten class is learning about growing plants.
+The teacher thought it would be a good idea to give them actual seeds, plant them in actual dirt, and grow actual plants.
+
+They've chosen to grow grass, clover, radishes, and violets.
+
+To this end, the children have put little cups along the window sills, and
+planted one type of plant in each cup, choosing randomly from the available
+types of seeds.
+
+```text
+[window][window][window]
+........................ # each dot represents a cup
+........................
+```
+
+There are 12 children in the class:
+
+- Alice, Bob, Charlie, David,
+- Eve, Fred, Ginny, Harriet,
+- Ileana, Joseph, Kincaid, and Larry.
+
+Each child gets 4 cups, two on each row.
+Their teacher assigns cups to the children alphabetically by their names.
+
+The following diagram represents Alice's plants:
+
+```text
+[window][window][window]
+VR......................
+RG......................
+```
+
+In the first row, nearest the windows, she has a violet and a radish.
+In the second row she has a radish and some grass.
+
+Your program will be given the plants from left-to-right starting with the row nearest the windows.
+From this, it should be able to determine which plants belong to each student.
+
+For example, if it's told that the garden looks like so:
+
+```text
+[window][window][window]
+VRCGVVRVCGGCCGVRGCVCGCGV
+VRCCCGCRRGVCGCRVVCVGCGCV
+```
+
+Then if asked for Alice's plants, it should provide:
+
+- Violets, radishes, violets, radishes
+
+While asking for Bob's plants would yield:
+
+- Clover, grass, clover, clover

exercises/practice/kindergarten-garden/.meta/config.json

@@ -0,0 +1,21 @@
+{
+  "authors": [
+    "ahans"
+  ],
+  "files": {
+    "solution": [
+      "kindergarten_garden.c",
+      "kindergarten_garden.h"
+    ],
+    "test": [
+      "test_kindergarten_garden.c"
+    ],
+    "example": [
+      ".meta/example.c",
+      ".meta/example.h"
+    ]
+  },
+  "blurb": "Given a diagram, determine which plants each child in the kindergarten class is responsible for.",
+  "source": "Exercise by the JumpstartLab team for students at The Turing School of Software and Design.",
+  "source_url": "https://turing.edu"
+}

exercises/practice/kindergarten-garden/.meta/example.c

@@ -0,0 +1,46 @@
+#include "kindergarten_garden.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+static int student_to_index(const char *student)
+{
+   static const char *students[] = { "Alice",  "Bob",    "Charlie", "David",
+                                     "Eve",    "Fred",   "Ginny",   "Harriet",
+                                     "Ileana", "Joseph", "Kincaid", "Larry" };
+   for (size_t i = 0; i < sizeof(students); ++i) {
+      if (strcmp(students[i], student) == 0) {
+         return i;
+      }
+   }
+   printf("error: student %s not found\n", student);
+   exit(1);
+}
+
+static plant_t letter_to_plant(char letter)
+{
+   switch (letter) {
+      case 'C':
+         return CLOVER;
+      case 'G':
+         return GRASS;
+      case 'R':
+         return RADISHES;
+      case 'V':
+         return VIOLETS;
+   }
+   printf("error: letter %c does not match any plant\n", letter);
+   exit(1);
+}
+
+void plants(const char *diagram, const char *student, plant_t *plants)
+{
+   const char *rows[] = { diagram, strchr(diagram, '\n') + 1 };
+   const size_t student_col = student_to_index(student) * 2;
+   for (int i = 0; i < 4; ++i) {
+      const size_t row_index = i / 2;
+      const size_t col_index = student_col + i % 2;
+      plants[i] = letter_to_plant(rows[row_index][col_index]);
+   }
+}

exercises/practice/kindergarten-garden/.meta/example.h

@@ -0,0 +1,8 @@
+#ifndef KINDERGARTEN_GARDEN_H
+#define KINDERGARTEN_GARDEN_H
+
+typedef enum { CLOVER = 0, GRASS = 1, RADISHES = 2, VIOLETS = 3 } plant_t;
+
+void plants(const char *diagram, const char *student, plant_t *plants);
+
+#endif

exercises/practice/kindergarten-garden/.meta/tests.toml

@@ -0,0 +1,61 @@
+# This is an auto-generated file.
+#
+# Regenerating this file via `configlet sync` will:
+# - Recreate every `description` key/value pair
+# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications
+# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion)
+# - Preserve any other key/value pair
+#
+# As user-added comments (using the # character) will be removed when this file
+# is regenerated, comments can be added via a `comment` key.
+
+[1fc316ed-17ab-4fba-88ef-3ae78296b692]
+description = "partial garden -> garden with single student"
+
+[acd19dc1-2200-4317-bc2a-08f021276b40]
+description = "partial garden -> different garden with single student"
+
+[c376fcc8-349c-446c-94b0-903947315757]
+description = "partial garden -> garden with two students"
+
+[2d620f45-9617-4924-9d27-751c80d17db9]
+description = "partial garden -> multiple students for the same garden with three students -> second student's garden"
+
+[57712331-4896-4364-89f8-576421d69c44]
+description = "partial garden -> multiple students for the same garden with three students -> third student's garden"
+
+[149b4290-58e1-40f2-8ae4-8b87c46e765b]
+description = "full garden -> for Alice, first student's garden"
+
+[ba25dbbc-10bd-4a37-b18e-f89ecd098a5e]
+description = "full garden -> for Bob, second student's garden"
+
+[566b621b-f18e-4c5f-873e-be30544b838c]
+description = "full garden -> for Charlie"
+
+[3ad3df57-dd98-46fc-9269-1877abf612aa]
+description = "full garden -> for David"
+
+[0f0a55d1-9710-46ed-a0eb-399ba8c72db2]
+description = "full garden -> for Eve"
+
+[a7e80c90-b140-4ea1-aee3-f4625365c9a4]
+description = "full garden -> for Fred"
+
+[9d94b273-2933-471b-86e8-dba68694c615]
+description = "full garden -> for Ginny"
+
+[f55bc6c2-ade8-4844-87c4-87196f1b7258]
+description = "full garden -> for Harriet"
+
+[759070a3-1bb1-4dd4-be2c-7cce1d7679ae]
+description = "full garden -> for Ileana"
+
+[78578123-2755-4d4a-9c7d-e985b8dda1c6]
+description = "full garden -> for Joseph"
+
+[6bb66df7-f433-41ab-aec2-3ead6e99f65b]
+description = "full garden -> for Kincaid, second to last student's garden"
+
+[d7edec11-6488-418a-94e6-ed509e0fa7eb]
+description = "full garden -> for Larry, last student's garden"

exercises/practice/kindergarten-garden/kindergarten_garden.c

@@ -0,0 +1,46 @@
+#include "kindergarten_garden.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+static int student_to_index(const char *student)
+{
+   static const char *students[] = { "Alice",  "Bob",    "Charlie", "David",
+                                     "Eve",    "Fred",   "Ginny",   "Harriet",
+                                     "Ileana", "Joseph", "Kincaid", "Larry" };
+   for (size_t i = 0; i < sizeof(students); ++i) {
+      if (strcmp(students[i], student) == 0) {
+         return i;
+      }
+   }
+   printf("error: student %s not found\n", student);
+   exit(1);
+}
+
+static plant_t letter_to_plant(char letter)
+{
+   switch (letter) {
+      case 'C':
+         return CLOVER;
+      case 'G':
+         return GRASS;
+      case 'R':
+         return RADISHES;
+      case 'V':
+         return VIOLETS;
+   }
+   printf("error: letter %c does not match any plant\n", letter);
+   exit(1);
+}
+
+void plants(const char *diagram, const char *student, plant_t *plants)
+{
+   const char *rows[] = { diagram, strchr(diagram, '\n') + 1 };
+   const size_t student_col = student_to_index(student) * 2;
+   for (int i = 0; i < 4; ++i) {
+      const size_t row_index = i / 2;
+      const size_t col_index = student_col + i % 2;
+      plants[i] = letter_to_plant(rows[row_index][col_index]);
+   }
+}

exercises/practice/kindergarten-garden/kindergarten_garden.h

@@ -0,0 +1,6 @@
+#ifndef KINDERGARTEN_GARDEN_H
+#define KINDERGARTEN_GARDEN_H
+
+typedef enum { CLOVER = 0, GRASS = 1, RADISHES = 2, VIOLETS = 3 } plant_t;
+
+#endif