Add flower-field exercise (#510)

Author: keiravillekode

config.json

@@ -1035,6 +1035,14 @@
         "prerequisites": [],
         "difficulty": 6
       },
+      {
+        "slug": "flower-field",
+        "name": "Flower Field",
+        "uuid": "afd931dd-33dd-4961-bd2b-251c62fb9311",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 6
+      },
       {
         "slug": "piecing-it-together",
         "name": "Piecing It Together",

exercises/practice/flower-field/.docs/instructions.md

@@ -0,0 +1,26 @@
+# Instructions
+
+Your task is to add flower counts to empty squares in a completed Flower Field garden.
+The garden itself is a rectangle board composed of squares that are either empty (`' '`) or a flower (`'*'`).
+
+For each empty square, count the number of flowers adjacent to it (horizontally, vertically, diagonally).
+If the empty square has no adjacent flowers, leave it empty.
+Otherwise replace it with the count of adjacent flowers.
+
+For example, you may receive a 5 x 4 board like this (empty spaces are represented here with the '·' character for display on screen):
+
+```text
+·*·*·
+··*··
+··*··
+·····
+```
+
+Which your code should transform into this:
+
+```text
+1*3*1
+13*31
+·2*2·
+·111·
+```

exercises/practice/flower-field/.docs/introduction.md

@@ -0,0 +1,7 @@
+# Introduction
+
+[Flower Field][history] is a compassionate reimagining of the popular game Minesweeper.
+The object of the game is to find all the flowers in the garden using numeric hints that indicate how many flowers are directly adjacent (horizontally, vertically, diagonally) to a square.
+"Flower Field" shipped in regional versions of Microsoft Windows in Italy, Germany, South Korea, Japan and Taiwan.
+
+[history]: https://web.archive.org/web/20020409051321fw_/http://rcm.usr.dsi.unimi.it/rcmweb/fnm/

exercises/practice/flower-field/.meta/config.json

@@ -0,0 +1,17 @@
+{
+  "authors": [
+    "keiravillekode"
+  ],
+  "files": {
+    "solution": [
+      "flower_field.zig"
+    ],
+    "test": [
+      "test_flower_field.zig"
+    ],
+    "example": [
+      ".meta/example.zig"
+    ]
+  },
+  "blurb": "Mark all the flowers in a garden."
+}

exercises/practice/flower-field/.meta/example.zig

@@ -0,0 +1,50 @@
+const std = @import("std");
+const mem = std.mem;
+
+fn free(allocator: mem.Allocator, array_list: *std.ArrayList([]u8)) void {
+    for (array_list.items) |item| {
+        allocator.free(item);
+    }
+    array_list.deinit(allocator);
+}
+
+pub fn annotate(allocator: mem.Allocator, garden: []const []const u8) mem.Allocator.Error![][]u8 {
+    const height = garden.len;
+    var array_list = try std.ArrayList([]u8).initCapacity(allocator, height);
+    errdefer free(allocator, &array_list);
+    if (height == 0) {
+        return array_list.toOwnedSlice(allocator);
+    }
+
+    const width = garden[0].len;
+
+    for (0..height) |i| {
+        var row = try allocator.alloc(u8, width);
+        for (0..width) |j| {
+            if (garden[i][j] == '*') {
+                row[j] = '*';
+            } else {
+                var count: u8 = 0;
+                for (0..3) |di| {
+                    for (0..3) |dj| {
+                        const r = i + di;
+                        const c = j + dj;
+                        if (r >= 1 and c >= 1 and r <= height and c <= width and garden[r - 1][c - 1] == '*') {
+                            count += 1;
+                        }
+                    }
+                }
+
+                if (count == 0) {
+                    row[j] = ' ';
+                } else {
+                    row[j] = '0' + count;
+                }
+            }
+        }
+
+        array_list.appendAssumeCapacity(row);
+    }
+
+    return array_list.toOwnedSlice(allocator);
+}

exercises/practice/flower-field/.meta/tests.toml

@@ -0,0 +1,46 @@
+# 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.
+
+[237ff487-467a-47e1-9b01-8a891844f86c]
+description = "no rows"
+
+[4b4134ec-e20f-439c-a295-664c38950ba1]
+description = "no columns"
+
+[d774d054-bbad-4867-88ae-069cbd1c4f92]
+description = "no flowers"
+
+[225176a0-725e-43cd-aa13-9dced501f16e]
+description = "garden full of flowers"
+
+[3f345495-f1a5-4132-8411-74bd7ca08c49]
+description = "flower surrounded by spaces"
+
+[6cb04070-4199-4ef7-a6fa-92f68c660fca]
+description = "space surrounded by flowers"
+
+[272d2306-9f62-44fe-8ab5-6b0f43a26338]
+description = "horizontal line"
+
+[c6f0a4b2-58d0-4bf6-ad8d-ccf4144f1f8e]
+description = "horizontal line, flowers at edges"
+
+[a54e84b7-3b25-44a8-b8cf-1753c8bb4cf5]
+description = "vertical line"
+
+[b40f42f5-dec5-4abc-b167-3f08195189c1]
+description = "vertical line, flowers at edges"
+
+[58674965-7b42-4818-b930-0215062d543c]
+description = "cross"
+
+[dd9d4ca8-9e68-4f78-a677-a2a70fd7a7b8]
+description = "large garden"

exercises/practice/flower-field/flower_field.zig

@@ -0,0 +1,8 @@
+const std = @import("std");
+const mem = std.mem;
+
+pub fn annotate(allocator: mem.Allocator, garden: []const []const u8) mem.Allocator.Error![][]u8 {
+    _ = allocator;
+    _ = garden;
+    @compileError("please implement the annotate function");
+}