JavaScript

CHALLENGE

const compose = (...fns) => x => fns.reduceRight((acc, fn) => fn(acc), x);
const pipe = (...fns) => x => fns.reduce((acc, fn) => fn(acc), x);

const inc = x => x + 1;
const double = x => x * 2;
const square = x => x * x;

const f = compose(square, double, inc);
const g = pipe(square, double, inc);

console.log(f(2), g(2));

CHALLENGE

function* inner() {
  yield 1;
  yield 2;
  return 'inner-done';
}

function* outer() {
  const result = yield* inner();
  yield result;
  yield 3;
}

const gen = outer();
const results = [];
let r = gen.next();
while (!r.done) {
  results.push(r.value);
  r = gen.next();
}
console.log(results.join(','));

export {};

CHALLENGE

class Base {}
class Derived extends Base {
  static [Symbol.hasInstance](instance) {
    return false;
  }
}
const d = new Derived();
console.log(d instanceof Derived, d instanceof Base, Object.getPrototypeOf(Derived) === Base);

CHALLENGE

function makeFns() {
  const result = [];
  for (var i = 0; i < 3; i++) {
    let j = i;
    result.push(() => i + j);
  }
  return result;
}
const fns = makeFns();
console.log(fns.map(f => f()).join(','));

CHALLENGE

const arr = [1, [2, 3], { a: 4 }];
const copy = [...arr];
copy[1].push(99);
copy[2].a = 100;
arr[0] = 999;

console.log(arr[0], arr[1], arr[2].a, copy[0]);

CHALLENGE

const a = Math.max();
const b = Math.min();
const c = 0.1 + 0.2 === 0.3;
const d = Math.max(1, NaN, 3);
const e = [1, 2, 3].reduce((sum, n) => sum + n, 0) / 3;
const f = Number.isInteger(5.0);
console.log(a, b, c, d, e, f);

CHALLENGE

function makeCounters() {
  const counters = [];
  for (var i = 0; i < 3; i++) {
    let j = i;
    counters.push(() => `${i}-${j}`);
  }
  return counters;
}
const [a, b, c] = makeCounters();
console.log(a(), b(), c());
export {};

CHALLENGE

class EventBus {
  #listeners = new Map();
  on(event, fn) {
    if (!this.#listeners.has(event)) this.#listeners.set(event, new Set());
    this.#listeners.get(event).add(fn);
    return () => this.#listeners.get(event).delete(fn);
  }
  emit(event, payload) {
    this.#listeners.get(event)?.forEach(fn => fn(payload));
  }
}
const bus = new EventBus();
const log = [];
const unsub = bus.on('data', v => log.push(`A:${v}`));
bus.on('data', v => log.push(`B:${v}`));
bus.emit('data', 1);
unsub();
bus.on('data', v => log.push(`C:${v}`));
bus.emit('data', 2);
console.log(log.join(','));

CHALLENGE

function Person(name) {
  if (!(this instanceof Person)) {
    return new Person(name);
  }
  this.name = name;
}

Person.prototype.greet = function () {
  return `Hi ${this.name}`;
};

function Widget(id) {
  this.id = id;
  return { id: id * 2 };
}

Widget.prototype.getId = function () {
  return this.id;
};

const p1 = Person('Zed');
const p2 = new Person('Nova');
const w = new Widget(5);

console.log(p1.greet(), p2.greet(), w.id, w.getId);

😮 DeepSeek Harness: DeepSeek's New Node-Powered Agent Harness Today, the popular Chinese model lab unveiled its own Claude Code-alike and already racked up 30k stars. It's not a typical CLI harness, though, but runs through a web UI. Curiously, everything is a plugin, built atop Cordis, an existing Node plugin system whose author DeepSeek has hired. GitHub repo. DeepSeek

CHALLENGE

const log = [];
Promise.resolve(1)
  .then(v => { log.push('a'+v); return v+1; })
  .then(v => { throw new Error('e'+v); })
  .catch(e => { log.push(e.message); return 10; })
  .then(v => { log.push('b'+v); });

Promise.resolve()
  .then(() => log.push('c'))
  .then(() => log.push('d'));

setTimeout(() => console.log(log.join(',')), 0);