These problems are designed to be around exam difficulty. For more basic problems, see the topic-based guides and practice problems!
Write a function non-contiguous that checks whether subseq is a non-contiguous subsequence of lst. A sequence is a non-contiguous subsequence if its elements appear in the list in order but not necessarily immediately next to each other.
Explanation: Our base case takes care of the case where the two lists are the same. Our recursive case then states that for the first list to be a suffix of the second, it must be a suffix of the rest of the list. When ?rest is assigned to a list that is the same as ?suf, the fact becomes a Success!.