docs: function containedInOrder(needle, haystack) {
    var i, j = 0;
    for (i = 0; i < needle.length; i++) {
      while (j < haystack.length && needle[i] !== haystack[j]) j++;
    }
    return i === needle.length && j < haystack.length;
  }