47. Binary Search Blocks

function search(blocks, target) {
  let l = 0, r = blocks.length - 1;
  while (l <= r) {
    const m = Math.floor((l + r) / 2);
    if (blocks[m].time === target) return m;
    if (blocks[m].time < target) l = m + 1; else r = m - 1;
  }
  return -1;
}