Какую самую интересную задачу решал

// Упрощенный пример QuadTree
class QuadTree {
  constructor(bounds, capacity) {
    this.bounds = bounds; // {x, y, width, height}
    this.capacity = capacity;
    this.points = [];
    this.divided = false;
  }

  insert(point) {
    if (!this.bounds.contains(point)) return false;
    if (this.points.length < this.capacity) {
      this.points.push(point);
      return true;
    }
    if (!this.divided) this.subdivide();
    return (
      this.northeast.insert(point) || 
      this.northwest.insert(point) ||
      this.southeast.insert(point) || 
      this.southwest.insert(point)
    );
  }
}