Who could be explain this solution for Circular Queue? plz

[tyomart]

Hi! I am very sorry, but I really can’t understand how it works (((( -

 if (this.write >= this.read + this.max + 1) return null;

Continuing the discussion from freeCodeCamp Challenge Guide: Create a Circular Queue:

@camperbot

 enqueue(item) {
    // Only change code below this line
    if (this.write >= this.read + this.max + 1) return null;
    this.queue[this.write % (this.max + 1)] = item;
    this.write++;
    return item;
    // Only change code above this line
  }