Beer song is deprecated

.github/workflows/test.yml

@@ -8,7 +8,7 @@ on:
 
 jobs:
   ci:
-    runs-on: ubuntu-20.04
+    runs-on: ubuntu-22.04
 
     steps:
       - name: Checkout repository

config.json

@@ -213,6 +213,7 @@
         "practices": [],
         "prerequisites": [],
         "difficulty": 3,
+        "status": "deprecated",
         "topics": [
           "algorithms",
           "control_flow",
@@ -1282,6 +1283,14 @@
         "practices": [],
         "prerequisites": [],
         "difficulty": 3
+      },
+      {
+        "slug": "bottle-song",
+        "name": "Bottle Song",
+        "uuid": "0c786feb-8653-4215-9281-2e1c83afeefe",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 3
       }
     ]
   },

exercises/practice/anagram/.docs/instructions.md

@@ -1,13 +1,12 @@
 # Instructions
 
-Your task is to, given a target word and a set of candidate words, to find the subset of the candidates that are anagrams of the target.
+Given a target word and one or more candidate words, your task is to find the candidates that are anagrams of the target.
 
 An anagram is a rearrangement of letters to form a new word: for example `"owns"` is an anagram of `"snow"`.
 A word is _not_ its own anagram: for example, `"stop"` is not an anagram of `"stop"`.
 
-The target and candidates are words of one or more ASCII alphabetic characters (`A`-`Z` and `a`-`z`).
-Lowercase and uppercase characters are equivalent: for example, `"PoTS"` is an anagram of `"sTOp"`, but `StoP` is not an anagram of `sTOp`.
-The anagram set is the subset of the candidate set that are anagrams of the target (in any order).
-Words in the anagram set should have the same letter case as in the candidate set.
+The target word and candidate words are made up of one or more ASCII alphabetic characters (`A`-`Z` and `a`-`z`).
+Lowercase and uppercase characters are equivalent: for example, `"PoTS"` is an anagram of `"sTOp"`, but `"StoP"` is not an anagram of `"sTOp"`.
+The words you need to find should be taken from the candidate words, using the same letter case.
 
-Given the target `"stone"` and candidates `"stone"`, `"tones"`, `"banana"`, `"tons"`, `"notes"`, `"Seton"`, the anagram set is `"tones"`, `"notes"`, `"Seton"`.
+Given the target `"stone"` and the candidate words `"stone"`, `"tones"`, `"banana"`, `"tons"`, `"notes"`, and `"Seton"`, the anagram words you need to find are `"tones"`, `"notes"`, and `"Seton"`.

exercises/practice/atbash-cipher/.docs/instructions.md

@@ -1,6 +1,6 @@
 # Instructions
 
-Create an implementation of the atbash cipher, an ancient encryption system created in the Middle East.
+Create an implementation of the Atbash cipher, an ancient encryption system created in the Middle East.
 
 The Atbash cipher is a simple substitution cipher that relies on transposing all the letters in the alphabet such that the resulting alphabet is backwards.
 The first letter is replaced with the last letter, the second with the second-last, and so on.

exercises/practice/bottle-song/.docs/instructions.md

@@ -0,0 +1,57 @@
+# Instructions
+
+Recite the lyrics to that popular children's repetitive song: Ten Green Bottles.
+
+Note that not all verses are identical.
+
+```text
+Ten green bottles hanging on the wall,
+Ten green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be nine green bottles hanging on the wall.
+
+Nine green bottles hanging on the wall,
+Nine green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be eight green bottles hanging on the wall.
+
+Eight green bottles hanging on the wall,
+Eight green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be seven green bottles hanging on the wall.
+
+Seven green bottles hanging on the wall,
+Seven green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be six green bottles hanging on the wall.
+
+Six green bottles hanging on the wall,
+Six green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be five green bottles hanging on the wall.
+
+Five green bottles hanging on the wall,
+Five green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be four green bottles hanging on the wall.
+
+Four green bottles hanging on the wall,
+Four green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be three green bottles hanging on the wall.
+
+Three green bottles hanging on the wall,
+Three green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be two green bottles hanging on the wall.
+
+Two green bottles hanging on the wall,
+Two green bottles hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be one green bottle hanging on the wall.
+
+One green bottle hanging on the wall,
+One green bottle hanging on the wall,
+And if one green bottle should accidentally fall,
+There'll be no green bottles hanging on the wall.
+```

exercises/practice/bottle-song/.meta/Example.scala

@@ -0,0 +1,17 @@
+object BottleSong:
+  private val numbers = List("no", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten")
+
+  private def suffix(bottles: Int) = if bottles == 1 then "" else "s"
+
+  private def hanging(bottles: Int) =
+    s"${numbers(bottles)} green bottle${suffix(bottles)} hanging on the wall"
+
+  private def firstLine(bottles: Int) = hanging(bottles) + ",\n"
+
+  private def lastLine(bottles: Int) = "There'll be " + hanging(bottles).toLowerCase + ".\n"
+
+  private def verse(bottles: Int) = firstLine(bottles).repeat(2) +
+    "And if one green bottle should accidentally fall,\n" + lastLine(bottles - 1)
+
+  def recite(startBottles: Int, takeDown: Int): String =
+    startBottles until startBottles - takeDown by -1 map verse mkString "\n"

exercises/practice/bottle-song/.meta/config.json

@@ -0,0 +1,19 @@
+{
+  "authors": [
+    "rabestro"
+  ],
+  "files": {
+    "solution": [
+      "src/main/scala/BottleSong.scala"
+    ],
+    "test": [
+      "src/test/scala/BottleSongTest.scala"
+    ],
+    "example": [
+      ".meta/Example.scala"
+    ]
+  },
+  "blurb": "Produce the lyrics to the popular children's repetitive song: Ten Green Bottles.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Ten_Green_Bottles"
+}

exercises/practice/bottle-song/.meta/tests.toml

@@ -0,0 +1,31 @@
+# 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.
+
+[d4ccf8fc-01dc-48c0-a201-4fbeb30f2d03]
+description = "verse -> single verse -> first generic verse"
+
+[0f0aded3-472a-4c64-b842-18d4f1f5f030]
+description = "verse -> single verse -> last generic verse"
+
+[f61f3c97-131f-459e-b40a-7428f3ed99d9]
+description = "verse -> single verse -> verse with 2 bottles"
+
+[05eadba9-5dbd-401e-a7e8-d17cc9baa8e0]
+description = "verse -> single verse -> verse with 1 bottle"
+
+[a4a28170-83d6-4dc1-bd8b-319b6abb6a80]
+description = "lyrics -> multiple verses -> first two verses"
+
+[3185d438-c5ac-4ce6-bcd3-02c9ff1ed8db]
+description = "lyrics -> multiple verses -> last three verses"
+
+[28c1584a-0e51-4b65-9ae2-fbc0bf4bbb28]
+description = "lyrics -> multiple verses -> all verses"

exercises/practice/bottle-song/build.sbt

@@ -0,0 +1,3 @@
+scalaVersion := "3.4.2"
+
+libraryDependencies += "org.scalatest" %% "scalatest" % "3.2.19" % Test

exercises/practice/bottle-song/project/build.properties

@@ -0,0 +1 @@
+sbt.version=1.10.1

exercises/practice/bottle-song/src/test/scala/BottleSongTest.scala

@@ -0,0 +1,134 @@
+import org.scalatest.funsuite.AnyFunSuite
+import org.scalatest.matchers.should.Matchers
+
+class BottleSongTest extends AnyFunSuite with Matchers {
+
+  test("first generic verse") {
+    BottleSong.recite(10, 1) shouldBe
+      """Ten green bottles hanging on the wall,
+        |Ten green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be nine green bottles hanging on the wall.
+        |""".stripMargin.trim + "\n"
+  }
+
+  test("last generic verse") {
+    pending
+    BottleSong.recite(3, 1) shouldBe
+      """Three green bottles hanging on the wall,
+        |Three green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be two green bottles hanging on the wall.
+        |""".stripMargin.trim + "\n"
+  }
+
+  test("verse with two bottles") {
+    pending
+    BottleSong.recite(2, 1) shouldBe
+      """Two green bottles hanging on the wall,
+        |Two green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be one green bottle hanging on the wall.
+        |""".stripMargin.trim + "\n"
+  }
+
+  test("verse with one bottle") {
+    pending
+    BottleSong.recite(1, 1) shouldBe
+      """One green bottle hanging on the wall,
+        |One green bottle hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be no green bottles hanging on the wall.
+        |""".stripMargin.trim + "\n"
+  }
+
+  test("first two verses") {
+    pending
+    BottleSong.recite(10, 2) shouldBe
+      """Ten green bottles hanging on the wall,
+        |Ten green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be nine green bottles hanging on the wall.
+        |
+        |Nine green bottles hanging on the wall,
+        |Nine green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be eight green bottles hanging on the wall.
+        |""".stripMargin.trim + "\n"
+  }
+
+  test("last three verses") {
+    pending
+    BottleSong.recite(3, 3) shouldBe
+      """Three green bottles hanging on the wall,
+        |Three green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be two green bottles hanging on the wall.
+        |
+        |Two green bottles hanging on the wall,
+        |Two green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be one green bottle hanging on the wall.
+        |
+        |One green bottle hanging on the wall,
+        |One green bottle hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be no green bottles hanging on the wall.
+        |""".stripMargin.trim + "\n"
+  }
+
+  test("all verses") {
+    pending
+    BottleSong.recite(10, 10) shouldBe
+      """Ten green bottles hanging on the wall,
+        |Ten green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be nine green bottles hanging on the wall.
+        |
+        |Nine green bottles hanging on the wall,
+        |Nine green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be eight green bottles hanging on the wall.
+        |
+        |Eight green bottles hanging on the wall,
+        |Eight green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be seven green bottles hanging on the wall.
+        |
+        |Seven green bottles hanging on the wall,
+        |Seven green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be six green bottles hanging on the wall.
+        |
+        |Six green bottles hanging on the wall,
+        |Six green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be five green bottles hanging on the wall.
+        |
+        |Five green bottles hanging on the wall,
+        |Five green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be four green bottles hanging on the wall.
+        |
+        |Four green bottles hanging on the wall,
+        |Four green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be three green bottles hanging on the wall.
+        |
+        |Three green bottles hanging on the wall,
+        |Three green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be two green bottles hanging on the wall.
+        |
+        |Two green bottles hanging on the wall,
+        |Two green bottles hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be one green bottle hanging on the wall.
+        |
+        |One green bottle hanging on the wall,
+        |One green bottle hanging on the wall,
+        |And if one green bottle should accidentally fall,
+        |There'll be no green bottles hanging on the wall.
+        |""".stripMargin.trim + "\n"
+  }
+}

exercises/practice/change/.docs/instructions.md

@@ -1,14 +1,8 @@
 # Instructions
 
-Correctly determine the fewest number of coins to be given to a customer such that the sum of the coins' value would equal the correct amount of change.
+Determine the fewest number of coins to give a customer so that the sum of their values equals the correct amount of change.
 
-## For example
+## Examples
 
-- An input of 15 with [1, 5, 10, 25, 100] should return one nickel (5) and one dime (10) or [5, 10]
-- An input of 40 with [1, 5, 10, 25, 100] should return one nickel (5) and one dime (10) and one quarter (25) or [5, 10, 25]
-
-## Edge cases
-
-- Does your algorithm work for any given set of coins?
-- Can you ask for negative change?
-- Can you ask for a change value smaller than the smallest coin value?
+- An amount of 15 with available coin values [1, 5, 10, 25, 100] should return one coin of value 5 and one coin of value 10, or [5, 10].
+- An amount of 40 with available coin values [1, 5, 10, 25, 100] should return one coin of value 5, one coin of value 10, and one coin of value 25, or [5, 10, 25].

exercises/practice/collatz-conjecture/.docs/instructions.md

@@ -1,29 +1,3 @@
 # Instructions
 
-The Collatz Conjecture or 3x+1 problem can be summarized as follows:
-
-Take any positive integer n.
-If n is even, divide n by 2 to get n / 2.
-If n is odd, multiply n by 3 and add 1 to get 3n + 1.
-Repeat the process indefinitely.
-The conjecture states that no matter which number you start with, you will always reach 1 eventually.
-
-Given a number n, return the number of steps required to reach 1.
-
-## Examples
-
-Starting with n = 12, the steps would be as follows:
-
-0. 12
-1. 6
-2. 3
-3. 10
-4. 5
-5. 16
-6. 8
-7. 4
-8. 2
-9. 1
-
-Resulting in 9 steps.
-So for input n = 12, the return value would be 9.
+Given a positive integer, return the number of steps it takes to reach 1 according to the rules of the Collatz Conjecture.