Vladislao

const bisect = (l, r, cond) => {
  while (l <= r) {
    const m = (l + r) >> 1;
    if (cond(m)) {
      l = m - 1;
    } else {
      r = m + 1;
    }
  }
  return l;

Vladislao

class UnionFind {
    constructor(size) {
        this.groups = new Array(size);
        this.ranks = [];
        for(let i = 0; i < size; i++) {
            this.groups[i] = i;
        }
    }

    find(node) {

Vladislao

find /run/network -name 'ifstate.*' | egrep -w -v -e `ifconfig | grep veth | cut -d' ' -f1 | xargs echo | tr ' ' '|'` | xargs -n1 rm