:chore: sort exercises and adjust difficulties (#79) (#82)

* chore: sort exercises and adjust difficulties * fix: configlet fmt Co-authored-by: Christian Willner <[email protected]>
exercism · Nov 26, 2024 · 9d08d82 · 9d08d82
1 parent 47f9b49
commit 9d08d82
Show file tree

Hide file tree

Showing 7 changed files with 80 additions and 0 deletions.
diff --git a/config.json b/config.json
@@ -450,6 +450,14 @@
         "prerequisites": [],
         "difficulty": 7
       },
+      {
+        "slug": "nth-prime",
+        "name": "Nth Prime",
+        "uuid": "1dabde92-f6b2-429d-9856-87c5aa1d027b",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 7
+      },
       {
         "slug": "saddle-points",
         "name": "Saddle Points",

diff --git a/exercises/practice/nth-prime/.docs/instructions.md b/exercises/practice/nth-prime/.docs/instructions.md
@@ -0,0 +1,7 @@
+# Instructions
+
+Given a number n, determine what the nth prime is.
+
+By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
+
+If your language provides methods in the standard library to deal with prime numbers, pretend they don't exist and implement them yourself.
diff --git a/exercises/practice/nth-prime/.meta/config.json b/exercises/practice/nth-prime/.meta/config.json
@@ -0,0 +1,19 @@
+{
+  "authors": [
+    "erikschierboom"
+  ],
+  "files": {
+    "solution": [
+      "nth-prime.ua"
+    ],
+    "test": [
+      "tests.ua"
+    ],
+    "example": [
+      ".meta/example.ua"
+    ]
+  },
+  "blurb": "Given a number n, determine what the nth prime is.",
+  "source": "A variation on Problem 7 at Project Euler",
+  "source_url": "https://projecteuler.net/problem=7"
+}
diff --git a/exercises/practice/nth-prime/.meta/example.ua b/exercises/practice/nth-prime/.meta/example.ua
@@ -0,0 +1,2 @@
+IsPrime ← =1⧻°/×
+Prime   ← ⨬(⍤ "there is no zeroth prime" 0|⊙⋅◌⍢(⊙+⟜IsPrime+1|⋅>) 1 0)±.
diff --git a/exercises/practice/nth-prime/.meta/tests.toml b/exercises/practice/nth-prime/.meta/tests.toml
@@ -0,0 +1,25 @@
+# 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.
+
+[75c65189-8aef-471a-81de-0a90c728160c]
+description = "first prime"
+
+[2c38804c-295f-4701-b728-56dea34fd1a0]
+description = "second prime"
+
+[56692534-781e-4e8c-b1f9-3e82c1640259]
+description = "sixth prime"
+
+[fce1e979-0edb-412d-93aa-2c744e8f50ff]
+description = "big prime"
+
+[bd0a9eae-6df7-485b-a144-80e13c7d55b2]
+description = "there is no zeroth prime"
diff --git a/exercises/practice/nth-prime/nth-prime.ua b/exercises/practice/nth-prime/nth-prime.ua
@@ -0,0 +1,3 @@
+# Return the Nth prime number
+# NthPrime | Nth
+Prime ← |1 ⊙(⍤ "Please implement Prime" 0)
diff --git a/exercises/practice/nth-prime/tests.ua b/exercises/practice/nth-prime/tests.ua
@@ -0,0 +1,16 @@
+~ "nth-prime.ua" ~ Prime
+
+# First prime
+⍤⤙≍ 2 Prime 1
+
+# Second prime
+⍤⤙≍ 3 Prime 2
+
+# Sixth prime
+⍤⤙≍ 13 Prime 6
+
+# Big prime
+⍤⤙≍ 104743 Prime 10001
+
+# There is no zeroth prime
+⍤⤙≍ "there is no zeroth prime" ⍣(Prime 0)
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,2 @@
		IsPrime ← =1⧻°/×
		Prime ← ⨬(⍤ "there is no zeroth prime" 0\|⊙⋅◌⍢(⊙+⟜IsPrime+1\|⋅>) 1 0)±.