import numpy as np
def isin_seq(a,b):
# Look for the presence of b in a, while keeping the sequence
sidx = a.argsort()
idx = np.searchsorted(a,b,sorter=sidx)
idx[idx==len(a)] = 0
ssidx = sidx[idx]
return (np.diff(ssidx)==1).all() & (a[ssidx]==b).all()
haystack = np.array([1, 1, 2])
needle = np.array([1, 2])
print(isin_seq(haystack, needle))
aW1wb3J0IG51bXB5IGFzIG5wCgpkZWYgaXNpbl9zZXEoYSxiKToKICAgICMgTG9vayBmb3IgdGhlIHByZXNlbmNlIG9mIGIgaW4gYSwgd2hpbGUga2VlcGluZyB0aGUgc2VxdWVuY2UKICAgIHNpZHggPSBhLmFyZ3NvcnQoKQogICAgaWR4ID0gbnAuc2VhcmNoc29ydGVkKGEsYixzb3J0ZXI9c2lkeCkKICAgIGlkeFtpZHg9PWxlbihhKV0gPSAwCiAgICBzc2lkeCA9IHNpZHhbaWR4XQogICAgcmV0dXJuIChucC5kaWZmKHNzaWR4KT09MSkuYWxsKCkgJiAoYVtzc2lkeF09PWIpLmFsbCgpCgpoYXlzdGFjayA9IG5wLmFycmF5KFsxLCAxLCAyXSkKbmVlZGxlID0gbnAuYXJyYXkoWzEsIDJdKQoKcHJpbnQoaXNpbl9zZXEoaGF5c3RhY2ssIG5lZWRsZSkp