Add sublist (#348)

config.json

@@ -501,6 +501,14 @@
         "prerequisites": [],
         "difficulty": 2
       },
+      {
+        "slug": "sublist",
+        "name": "Sublist",
+        "uuid": "860ca217-9d4f-4102-9b98-1c524a477bbf",
+        "practices": [],
+        "prerequisites": [],
+        "difficulty": 2
+      },
       {
         "slug": "triangle",
         "name": "Triangle",

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": [
+    "BNAndras"
+  ],
+  "files": {
+    "solution": [
+      "sublist.coffee"
+    ],
+    "test": [
+      "sublist.spec.coffee"
+    ],
+    "example": [
+      ".meta/example.coffee"
+    ]
+  },
+  "blurb": "Write a function to determine if a list is a sublist of another list."
+}

exercises/practice/sublist/.meta/example.coffee

@@ -0,0 +1,24 @@
+Classification =
+  equal: 'equal'
+  unequal: 'unequal'
+  sublist: 'sublist'
+  superlist: 'superlist'
+
+class Sublist
+  @classify: (listOne, listTwo) ->
+    if JSON.stringify(listOne) == JSON.stringify(listTwo)
+      Classification.equal
+    else if @is_superlist(listOne, listTwo)
+      Classification.superlist
+    else if @is_superlist(listTwo, listOne)
+      Classification.sublist
+    else
+      Classification.unequal
+
+  @is_superlist: (listOne, listTwo) ->
+    for i in [0..listOne.length - listTwo.length]
+      if listOne.slice(i, i + listTwo.length).join() == listTwo.join()
+        return true
+    false
+
+module.exports = { Sublist, Classification }

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

@@ -0,0 +1,64 @@
+# 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.
+
+[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/sublist.coffee

@@ -0,0 +1,8 @@
+Classification =
+# Replace this line with the necessary Classification object properties.
+
+class Sublist
+  @classify: (listOne, listTwo) ->
+    # Replace this line with your code.
+
+module.exports = { Sublist, Classification }

exercises/practice/sublist/sublist.spec.coffee

@@ -0,0 +1,110 @@
+{ Sublist, Classification } = require './sublist'
+
+describe 'Sublist', ->
+    it 'empty lists', ->
+        listOne = []
+        listTwo = []
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.equal
+
+    xit 'empty list within non empty list', ->
+        listOne = []
+        listTwo = [1, 2, 3]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.sublist
+
+    xit 'non empty list contains empty list', ->
+        listOne = [1, 2, 3]
+        listTwo = []
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.superlist
+
+    xit 'list equals itself', ->
+        listOne = [1, 2, 3]
+        listTwo = [1, 2, 3]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.equal
+
+    xit 'different lists', ->
+        listOne = [1, 2, 3]
+        listTwo = [2, 3, 4]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.unequal
+
+    xit 'false start', ->
+        listOne = [1, 2, 5]
+        listTwo = [0, 1, 2, 3, 1, 2, 5, 6]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.sublist
+
+    xit 'consecutive', ->
+        listOne = [1, 1, 2]
+        listTwo = [0, 1, 1, 1, 2, 1, 2]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.sublist
+
+    xit 'sublist at start', ->
+        listOne = [0, 1, 2]
+        listTwo = [0, 1, 2, 3, 4, 5]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.sublist
+
+    xit 'sublist in middle', ->
+        listOne = [2, 3, 4]
+        listTwo = [0, 1, 2, 3, 4, 5]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.sublist
+
+    xit 'sublist at end', ->
+        listOne = [3, 4, 5]
+        listTwo = [0, 1, 2, 3, 4, 5]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.sublist
+
+    xit 'at start of superlist', ->
+        listOne = [0, 1, 2, 3, 4, 5]
+        listTwo = [0, 1, 2]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.superlist
+
+    xit 'in middle of superlist', ->
+        listOne = [0, 1, 2, 3, 4, 5]
+        listTwo = [2, 3]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.superlist
+
+    xit 'at end of superlist', ->
+        listOne = [0, 1, 2, 3, 4, 5]
+        listTwo = [3, 4, 5]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.superlist
+
+    xit 'first list missing element from second list', ->
+        listOne = [1, 3]
+        listTwo = [1, 2, 3]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.unequal
+
+    xit 'second list missing element from first list', ->
+        listOne = [1, 2, 3]
+        listTwo = [1, 3]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.unequal
+
+    xit 'first list missing additional digits from second list', ->
+        listOne = [1, 2]
+        listTwo = [1, 22]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.unequal
+
+    xit 'order matters to a list', ->
+        listOne = [1, 2, 3]
+        listTwo = [3, 2, 1]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.unequal
+
+    xit 'same digits but different numbers', ->
+        listOne = [1, 0, 1]
+        listTwo = [10, 1]
+        result = Sublist.classify listOne, listTwo
+        expect(result).toEqual Classification.unequal