pangram exercise (#61)

Co-authored-by: Luca Ferranti <[email protected]>

config.json

@@ -210,6 +210,14 @@
         "prerequisites": [],
         "difficulty": 1
       },
+      {
+        "slug": "pangram",
+        "name": "Pangram",
+        "uuid": "f9a36482-c18f-4013-bfce-a559ad4c2f79",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 1
+      },
       {
         "slug": "anagram",
         "name": "Anagram",

exercises/practice/pangram/.docs/instructions.md

@@ -0,0 +1,8 @@
+# Instructions
+
+Your task is to figure out if a sentence is a pangram.
+
+A pangram is a sentence using every letter of the alphabet at least once.
+It is case insensitive, so it doesn't matter if a letter is lower-case (e.g. `k`) or upper-case (e.g. `K`).
+
+For this exercise, a sentence is a pangram if it contains each of the 26 letters in the English alphabet.

exercises/practice/pangram/.docs/introduction.md

@@ -0,0 +1,16 @@
+# Introduction
+
+You work for a company that sells fonts through their website.
+They'd like to show a different sentence each time someone views a font on their website.
+To give a comprehensive sense of the font, the random sentences should use **all** the letters in the English alphabet.
+
+They're running a competition to get suggestions for sentences that they can use.
+You're in charge of checking the submissions to see if they are valid.
+
+~~~~exercism/note
+Pangram comes from Greek, παν γράμμα, pan gramma, which means "every letter".
+
+The best known English pangram is:
+
+> The quick brown fox jumps over the lazy dog.
+~~~~

exercises/practice/pangram/.meta/config.json

@@ -0,0 +1,18 @@
+{
+  "authors": ["lucaferranti"],
+  "contributors": ["kytrinyx"],
+  "files": {
+    "solution": [
+      "src/pangram.chpl"
+    ],
+    "test": [
+      "test/tests.chpl"
+    ],
+    "example": [
+      ".meta/reference.chpl"
+    ]
+  },
+  "blurb": "Determine if a sentence is a pangram.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Pangram"
+}

exercises/practice/pangram/.meta/reference.chpl

@@ -0,0 +1,8 @@
+module Pangram {
+  const ALPHABET = "abcdefghijklmnopqrstuvwxyz";
+
+  proc isPangram(sentence: string): bool {
+    var low_sentence = sentence.toLower();
+    return && reduce [letter in ALPHABET] low_sentence.find(letter) >= 0;
+  }
+}

exercises/practice/pangram/.meta/tests.toml

@@ -0,0 +1,45 @@
+# 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.
+
+[64f61791-508e-4f5c-83ab-05de042b0149]
+description = "empty sentence"
+
+[74858f80-4a4d-478b-8a5e-c6477e4e4e84]
+description = "perfect lower case"
+
+[61288860-35ca-4abe-ba08-f5df76ecbdcd]
+description = "only lower case"
+
+[6564267d-8ac5-4d29-baf2-e7d2e304a743]
+description = "missing the letter 'x'"
+
+[c79af1be-d715-4cdb-a5f2-b2fa3e7e0de0]
+description = "missing the letter 'h'"
+
+[d835ec38-bc8f-48e4-9e36-eb232427b1df]
+description = "with underscores"
+
+[8cc1e080-a178-4494-b4b3-06982c9be2a8]
+description = "with numbers"
+
+[bed96b1c-ff95-45b8-9731-fdbdcb6ede9a]
+description = "missing letters replaced by numbers"
+
+[938bd5d8-ade5-40e2-a2d9-55a338a01030]
+description = "mixed case and punctuation"
+
+[2577bf54-83c8-402d-a64b-a2c0f7bb213a]
+description = "case insensitive"
+include = false
+
+[7138e389-83e4-4c6e-8413-1e40a0076951]
+description = "a-m and A-M are 26 different characters but not a pangram"
+reimplements = "2577bf54-83c8-402d-a64b-a2c0f7bb213a"

exercises/practice/pangram/Mason.toml

@@ -0,0 +1,5 @@
+[brick]
+name="pangram"
+version="0.1.0"
+chplVersion="1.33.0"
+type="application"

exercises/practice/pangram/src/pangram.chpl

@@ -0,0 +1,3 @@
+module Pangram {
+  // Write your solution here
+}

exercises/practice/pangram/test/tests.chpl

@@ -0,0 +1,45 @@
+use UnitTest;
+
+use Pangram;
+
+proc testEmptySentence(test : borrowed Test) throws {
+  test.assertFalse(isPangram(""));
+}
+
+proc testPerfectLowerCase(test : borrowed Test) throws {
+  test.assertTrue(isPangram("abcdefghijklmnopqrstuvwxyz"));
+}
+
+proc testOnlyLowerCase(test : borrowed Test) throws {
+  test.assertTrue(isPangram("the quick brown fox jumps over the lazy dog"));
+}
+
+proc testMissingTheLetterX(test : borrowed Test) throws {
+  test.assertFalse(isPangram("a quick movement of the enemy will jeopardize five gunboats"));
+}
+
+proc testMissingTheLetterH(test : borrowed Test) throws {
+  test.assertFalse(isPangram("five boxing wizards jump quickly at it"));
+}
+
+proc testWithUnderscores(test : borrowed Test) throws {
+  test.assertTrue(isPangram("the_quick_brown_fox_jumps_over_the_lazy_dog"));
+}
+
+proc testWithNumbers(test : borrowed Test) throws {
+  test.assertTrue(isPangram("the 1 quick brown fox jumps over the 2 lazy dogs"));
+}
+
+proc testMissingLettersReplacedByNumbers(test : borrowed Test) throws {
+  test.assertFalse(isPangram("7h3 qu1ck brown fox jumps ov3r 7h3 lazy dog"));
+}
+
+proc testMixedCaseAndPunctuation(test : borrowed Test) throws {
+  test.assertTrue(isPangram("\"Five quacking Zephyrs jolt my wax bed.\""));
+}
+
+proc testAMAndAMAre26DifferentCharactersButNotAPangram(test : borrowed Test) throws {
+  test.assertFalse(isPangram("abcdefghijklm ABCDEFGHIJKLM"));
+}
+
+UnitTest.main();