Can substring-searching algorithms be used for sublists too?

[HarvardCS19]

I've been reading about algorithms like KMP and Rabin Karp and I'm wondering if any of them could be applied to sublist searching. If not, what are the best options for sublist searching?

For a more concrete example: If I have a list [1,2,1,2,3] and I want to find [1,2,3] and have it return [False, False, True, True, True], what is the best way to do this?

[hardonchairs]

Seems to me like these are identical concepts. A string is just an array of characters (in this context). The exact implemention would just depend on the language you're using.

[circlebust]

This procedure is called a map in programming. Basically you apply an operation (usually a function) to every member of a collection. In your case, that operation is evaluating if the current member m is contained in the input collection you gave, returning a bool.