Sha256: e184719ec3edd6c884bdb0e25f33579ff9203f8f8cc32d688983a79af3ec22f6
Contents?: true
Size: 1.1 KB
Versions: 74
Compression:
Stored size: 1.1 KB
Contents
# 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. Examples: * 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 ## Hints To be able to compare data, the IComparable interface is used. For more information, see [this page](https://msdn.microsoft.com/en-us/library/system.icomparable(v=vs.110).aspx). ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
74 entries across 74 versions & 1 rubygems