Sublist in Haskell
Write a function to determine if a list is a sublist of another list.
exercism fetch haskell sublist
Given two lists determine if the first list is contained within the second list, if the second list is contained within the first list, if both lists are contained within each other or if none of these are true.
Specifically, a list A is a sublist of list B if by dropping 0 or more elements from the front of B and 0 or more elements from the back of B you get a list that's completely equal to A.
- A = [1, 2, 3], B = [1, 2, 3, 4, 5], A is a sublist of B
- A = [3, 4, 5], B = [1, 2, 3, 4, 5], A is a sublist of B
- A = [3, 4], B = [1, 2, 3, 4, 5], A is a sublist of B
- A = [1, 2, 3], B = [1, 2, 3], A is equal to B
- A = [1, 2, 3, 4, 5], B = [2, 3, 4], A is a superlist of B
- A = [1, 2, 4], B = [1, 2, 3, 4, 5], A is not a superlist of, sublist of or equal to B
To complete this exercise, you need to implement the
For installation and learning resources, refer to the exercism help page.
Running the tests
To run the test suite, execute the following command:
If you get an error message like this...
No .cabal file found in directory
You are probably running an old stack version and need to upgrade it.
Otherwise, if you get an error message like this...
No compiler found, expected minor version match with... Try running "stack setup" to install the correct GHC...
Just do as it says and it will download and install the correct compiler version:
If you want to play with your solution in GHCi, just run the command:
Feedback, Issues, Pull Requests
The exercism/haskell repository on GitHub is the home for all of the Haskell exercises.
If you have feedback about an exercise, or want to help implementing a new one, head over there and create an issue. We'll do our best to help you!
Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.