Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add sublist exercise #272

Merged
merged 2 commits into from
Jan 19, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 11 additions & 0 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -443,6 +443,17 @@
"strings"
]
},
{
"slug": "sublist",
"name": "Sublist",
"uuid": "ab525174-18aa-4458-bc86-d669a6679c5a",
"practices": [],
"prerequisites": [],
"difficulty": 4,
"topics": [
"lists"
]
},
{
"slug": "queen-attack",
"name": "Queen Attack",
Expand Down
25 changes: 25 additions & 0 deletions exercises/practice/sublist/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -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
17 changes: 17 additions & 0 deletions exercises/practice/sublist/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
{
"authors": [
"keiravillekode"
],
"files": {
"solution": [
"sublist.sml"
],
"test": [
"test.sml"
],
"example": [
".meta/example.sml"
]
},
"blurb": "Write a function to determine if a list is a sublist of another list."
}
22 changes: 22 additions & 0 deletions exercises/practice/sublist/.meta/example.sml
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
datatype relation =
Equal
| Superlist
| Sublist
| Unequal

local
fun isPrefix (listOne: int list, listTwo: int list): bool =
case (listOne, listTwo) of
(nil, _) => true
| (_, nil) => false
| (firstOne :: restOne, firstTwo :: restTwo) => firstOne = firstTwo andalso isPrefix (restOne, restTwo)

fun isSublist (listOne: int list, listTwo: int list): bool =
isPrefix (listOne, listTwo) orelse (listTwo <> nil andalso isSublist (listOne, tl listTwo))
in
fun sublist (listOne: int list, listTwo: int list): relation =
if listOne = listTwo then Equal
else if isSublist(listOne, listTwo) then Sublist
else if isSublist(listTwo, listOne) then Superlist
else Unequal
end
64 changes: 64 additions & 0 deletions exercises/practice/sublist/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -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"
8 changes: 8 additions & 0 deletions exercises/practice/sublist/sublist.sml
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
datatype relation =
Equal
| Superlist
| Sublist
| Unequal

fun sublist (listOne: int list, listTwo: int list): relation =
raise Fail "'sublist' is not implemented"
156 changes: 156 additions & 0 deletions exercises/practice/sublist/test.sml
Original file line number Diff line number Diff line change
@@ -0,0 +1,156 @@
(* version 1.0.0 *)

use "testlib.sml";
use "sublist.sml";

infixr |>
fun x |> f = f x

val testsuite =
describe "sublist" [
test "empty lists"
(fn _ => let
val listOne = []
val listTwo = []
in
sublist (listOne, listTwo) |> Expect.equalTo Equal
end),

test "empty list within non empty list"
(fn _ => let
val listOne = []
val listTwo = [1, 2, 3]
in
sublist (listOne, listTwo) |> Expect.equalTo Sublist
end),

test "non empty list contains empty list"
(fn _ => let
val listOne = [1, 2, 3]
val listTwo = []
in
sublist (listOne, listTwo) |> Expect.equalTo Superlist
end),

test "list equals itself"
(fn _ => let
val listOne = [1, 2, 3]
val listTwo = [1, 2, 3]
in
sublist (listOne, listTwo) |> Expect.equalTo Equal
end),

test "different lists"
(fn _ => let
val listOne = [1, 2, 3]
val listTwo = [2, 3, 4]
in
sublist (listOne, listTwo) |> Expect.equalTo Unequal
end),

test "false start"
(fn _ => let
val listOne = [1, 2, 5]
val listTwo = [0, 1, 2, 3, 1, 2, 5, 6]
in
sublist (listOne, listTwo) |> Expect.equalTo Sublist
end),

test "consecutive"
(fn _ => let
val listOne = [1, 1, 2]
val listTwo = [0, 1, 1, 1, 2, 1, 2]
in
sublist (listOne, listTwo) |> Expect.equalTo Sublist
end),

test "sublist at start"
(fn _ => let
val listOne = [0, 1, 2]
val listTwo = [0, 1, 2, 3, 4, 5]
in
sublist (listOne, listTwo) |> Expect.equalTo Sublist
end),

test "sublist in middle"
(fn _ => let
val listOne = [2, 3, 4]
val listTwo = [0, 1, 2, 3, 4, 5]
in
sublist (listOne, listTwo) |> Expect.equalTo Sublist
end),

test "sublist at end"
(fn _ => let
val listOne = [3, 4, 5]
val listTwo = [0, 1, 2, 3, 4, 5]
in
sublist (listOne, listTwo) |> Expect.equalTo Sublist
end),

test "at start of superlist"
(fn _ => let
val listOne = [0, 1, 2, 3, 4, 5]
val listTwo = [0, 1, 2]
in
sublist (listOne, listTwo) |> Expect.equalTo Superlist
end),

test "in middle of superlist"
(fn _ => let
val listOne = [0, 1, 2, 3, 4, 5]
val listTwo = [2, 3]
in
sublist (listOne, listTwo) |> Expect.equalTo Superlist
end),

test "at end of superlist"
(fn _ => let
val listOne = [0, 1, 2, 3, 4, 5]
val listTwo = [3, 4, 5]
in
sublist (listOne, listTwo) |> Expect.equalTo Superlist
end),

test "first list missing element from second list"
(fn _ => let
val listOne = [1, 3]
val listTwo = [1, 2, 3]
in
sublist (listOne, listTwo) |> Expect.equalTo Unequal
end),

test "second list missing element from first list"
(fn _ => let
val listOne = [1, 2, 3]
val listTwo = [1, 3]
in
sublist (listOne, listTwo) |> Expect.equalTo Unequal
end),

test "first list missing additional digits from second list"
(fn _ => let
val listOne = [1, 2]
val listTwo = [1, 22]
in
sublist (listOne, listTwo) |> Expect.equalTo Unequal
end),

test "order matters to a list"
(fn _ => let
val listOne = [1, 2, 3]
val listTwo = [3, 2, 1]
in
sublist (listOne, listTwo) |> Expect.equalTo Unequal
end),

test "same digits but different numbers"
(fn _ => let
val listOne = [1, 0, 1]
val listTwo = [10, 1]
in
sublist (listOne, listTwo) |> Expect.equalTo Unequal
end)
]

val _ = Test.run testsuite
Loading