feat: Add sublist exercise (#178)

* feat: Add sublist exercise

* use match

Author: keiravillekode

config.json

@@ -129,6 +129,14 @@
         "prerequisites": [],
         "difficulty": 3
       },
+      {
+        "slug": "sublist",
+        "name": "Sublist",
+        "uuid": "61a1c85e-2137-4c11-9265-85a0ef9800ae",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 3
+      },
       {
         "slug": "square-root",
         "name": "Square Root",

exercises/practice/sublist/.docs/instructions.md

@@ -0,0 +1,25 @@
+# Instructions
+
+Given any two lists `A` and `B`, determine if:
+
+- List `A` is equal to list `B`; or
+- List `A` contains list `B` (`A` is a superlist of `B`); or
+- List `A` is contained by list `B` (`A` is a sublist of `B`); or
+- None of the above is true, thus lists `A` and `B` are unequal
+
+Specifically, list `A` is equal to list `B` if both lists have the same values in the same order.
+List `A` is a superlist of `B` if `A` contains a sub-sequence of values equal to `B`.
+List `A` is a sublist of `B` if `B` contains a sub-sequence of values equal to `A`.
+
+Examples:
+
+- If `A = []` and `B = []` (both lists are empty), then `A` and `B` are equal
+- If `A = [1, 2, 3]` and `B = []`, then `A` is a superlist of `B`
+- If `A = []` and `B = [1, 2, 3]`, then `A` is a sublist of `B`
+- If `A = [1, 2, 3]` and `B = [1, 2, 3, 4, 5]`, then `A` is a sublist of `B`
+- If `A = [3, 4, 5]` and `B = [1, 2, 3, 4, 5]`, then `A` is a sublist of `B`
+- If `A = [3, 4]` and `B = [1, 2, 3, 4, 5]`, then `A` is a sublist of `B`
+- If `A = [1, 2, 3]` and `B = [1, 2, 3]`, then `A` and `B` are equal
+- If `A = [1, 2, 3, 4, 5]` and `B = [2, 3, 4]`, then `A` is a superlist of `B`
+- If `A = [1, 2, 4]` and `B = [1, 2, 3, 4, 5]`, then `A` and `B` are unequal
+- If `A = [1, 2, 3]` and `B = [1, 3, 2]`, then `A` and `B` are unequal

exercises/practice/sublist/.meta/config.json

@@ -0,0 +1,17 @@
+{
+  "authors": [
+    "keiravillekode"
+  ],
+  "files": {
+    "solution": [
+      "sublist.v"
+    ],
+    "test": [
+      "run_test.v"
+    ],
+    "example": [
+      ".meta/example.v"
+    ]
+  },
+  "blurb": "Write a function to determine if a list is a sublist of another list."
+}

exercises/practice/sublist/.meta/example.v

@@ -0,0 +1,25 @@
+module main
+
+enum Relation {
+	equal
+	sublist
+	superlist
+	unequal
+}
+
+fn is_sublist(list_one []int, list_two []int) bool {
+	return match true {
+		list_two.len < list_one.len { false }
+		list_one == list_two[0..list_one.len] { true }
+		else { is_sublist(list_one, list_two[1..]) }
+	}
+}
+
+fn compare(list_one []int, list_two []int) Relation {
+	return match true {
+		list_one == list_two { .equal }
+		is_sublist(list_one, list_two) { .sublist }
+		is_sublist(list_two, list_one) { .superlist }
+		else { .unequal }
+	}
+}

exercises/practice/sublist/.meta/tests.toml

@@ -0,0 +1,57 @@
+# This is an auto-generated file. Regular comments will be removed when this
+# file is regenerated. Regenerating will not touch any manually added keys,
+# so comments can be added in a "comment" key.
+
+[97319c93-ebc5-47ab-a022-02a1980e1d29]
+description = "empty lists"
+
+[de27dbd4-df52-46fe-a336-30be58457382]
+description = "empty list within non empty list"
+
+[5487cfd1-bc7d-429f-ac6f-1177b857d4fb]
+description = "non empty list contains empty list"
+
+[1f390b47-f6b2-4a93-bc23-858ba5dda9a6]
+description = "list equals itself"
+
+[7ed2bfb2-922b-4363-ae75-f3a05e8274f5]
+description = "different lists"
+
+[3b8a2568-6144-4f06-b0a1-9d266b365341]
+description = "false start"
+
+[dc39ed58-6311-4814-be30-05a64bc8d9b1]
+description = "consecutive"
+
+[d1270dab-a1ce-41aa-b29d-b3257241ac26]
+description = "sublist at start"
+
+[81f3d3f7-4f25-4ada-bcdc-897c403de1b6]
+description = "sublist in middle"
+
+[43bcae1e-a9cf-470e-923e-0946e04d8fdd]
+description = "sublist at end"
+
+[76cf99ed-0ff0-4b00-94af-4dfb43fe5caa]
+description = "at start of superlist"
+
+[b83989ec-8bdf-4655-95aa-9f38f3e357fd]
+description = "in middle of superlist"
+
+[26f9f7c3-6cf6-4610-984a-662f71f8689b]
+description = "at end of superlist"
+
+[0a6db763-3588-416a-8f47-76b1cedde31e]
+description = "first list missing element from second list"
+
+[83ffe6d8-a445-4a3c-8795-1e51a95e65c3]
+description = "second list missing element from first list"
+
+[7bc76cb8-5003-49ca-bc47-cdfbe6c2bb89]
+description = "first list missing additional digits from second list"
+
+[0d7ee7c1-0347-45c8-9ef5-b88db152b30b]
+description = "order matters to a list"
+
+[5f47ce86-944e-40f9-9f31-6368aad70aa6]
+description = "same digits but different numbers"

exercises/practice/sublist/run_test.v

@@ -0,0 +1,107 @@
+module main
+
+const empty = []int{cap: 0}
+
+fn test_empty_lists() {
+	assert compare(empty, empty) == .equal
+}
+
+fn test_empty_list_within_non_empty_list() {
+	list_two := [1, 2, 3]
+	assert compare(empty, list_two) == .sublist
+}
+
+fn test_non_empty_list_contains_empty_list() {
+	list_one := [1, 2, 3]
+	assert compare(list_one, empty) == .superlist
+}
+
+fn test_list_equals_itself() {
+	list_one := [1, 2, 3]
+	list_two := [1, 2, 3]
+	assert compare(list_one, list_two) == .equal
+}
+
+fn test_different_lists() {
+	list_one := [1, 2, 3]
+	list_two := [2, 3, 4]
+	assert compare(list_one, list_two) == .unequal
+}
+
+fn test_false_start() {
+	list_one := [1, 2, 5]
+	list_two := [0, 1, 2, 3, 1, 2, 5, 6]
+	assert compare(list_one, list_two) == .sublist
+}
+
+fn test_consecutive() {
+	list_one := [1, 1, 2]
+	list_two := [0, 1, 1, 1, 2, 1, 2]
+	assert compare(list_one, list_two) == .sublist
+}
+
+fn test_sublist_at_start() {
+	list_one := [0, 1, 2]
+	list_two := [0, 1, 2, 3, 4, 5]
+	assert compare(list_one, list_two) == .sublist
+}
+
+fn test_sublist_in_middle() {
+	list_one := [2, 3, 4]
+	list_two := [0, 1, 2, 3, 4, 5]
+	assert compare(list_one, list_two) == .sublist
+}
+
+fn test_sublist_at_end() {
+	list_one := [3, 4, 5]
+	list_two := [0, 1, 2, 3, 4, 5]
+	assert compare(list_one, list_two) == .sublist
+}
+
+fn test_at_start_of_superlist() {
+	list_one := [0, 1, 2, 3, 4, 5]
+	list_two := [0, 1, 2]
+	assert compare(list_one, list_two) == .superlist
+}
+
+fn test_in_middle_of_superlist() {
+	list_one := [0, 1, 2, 3, 4, 5]
+	list_two := [2, 3]
+	assert compare(list_one, list_two) == .superlist
+}
+
+fn test_at_end_of_superlist() {
+	list_one := [0, 1, 2, 3, 4, 5]
+	list_two := [3, 4, 5]
+	assert compare(list_one, list_two) == .superlist
+}
+
+fn test_first_list_missing_element_from_second_list() {
+	list_one := [1, 3]
+	list_two := [1, 2, 3]
+	assert compare(list_one, list_two) == .unequal
+}
+
+fn test_second_list_missing_element_from_first_list() {
+	list_one := [1, 2, 3]
+	list_two := [1, 3]
+	assert compare(list_one, list_two) == .unequal
+}
+
+fn test_first_list_missing_additional_digits_from_second_list() {
+	list_one := [1, 2]
+	list_two := [1, 22]
+	assert compare(list_one, list_two) == .unequal
+}
+
+fn test_order_matters_to_a_list() {
+	list_one := [1, 2, 3]
+	list_two := [3, 2, 1]
+	assert compare(list_one, list_two) == .unequal
+}
+
+fn test_same_digits_but_different_numbers() {
+	list_one := [1, 0, 1]
+	list_two := [10, 1]
+	assert compare(list_one, list_two) == .unequal
+}

exercises/practice/sublist/sublist.v

@@ -0,0 +1,11 @@
+module main
+
+enum Relation {
+	equal
+	sublist
+	superlist
+	unequal
+}
+
+fn compare(list_one []int, list_two []int) Relation {
+}