No problem 🙂

Personally, I used concurrent accumulators, delay queues, and binary searches. The rest of them just for fun and know understand how it works

Thanks 🙂 To be honest, I didn’t do anything on ECS, so I don’t feel competent in this area…

Thanks 🙂

Yes. Thanks the tip 🙂

I would rather say they are all very similar 🙂

public boolean add(E e) {
return offer(e);
}

Here’s the put method:
public void put(E e) {
offer(e);
}

And finally offer:
public boolean offer(E e) {
final ReentrantLock lock = this.lock;
lock.lock();
try {
q.offer(e);
if (q.peek() == e) {
leader = null;
available.signal();
}
return true;
} finally {
lock.unlock();
}
}