622. Design Circular Queue

MyCircularQueue.cs

public class MyCircularQueue {
  private int[] _elements;
  private int _start = -1;
  private int _end = -1;
  private int _capacity = 0;
  private int _count = 0;
  
  public MyCircularQueue(int k) {
    _elements = new int[k];
    _capacity = k;
  }

  public bool EnQueue(int _value) {
    if(IsFull()) return false;
    if(_start < 0) _start++;
    _end = (_end + 1) % _capacity;
    _elements[_end] = _value;
    _count++;
    return true;
  }

  public bool DeQueue() {
    if(IsEmpty()) return false;
    _start = (_start + 1) % _capacity;
    _count--;
    return true;
  }

  public int Front() => IsEmpty() ? -1: _elements[_start];

  public int Rear() => IsEmpty() ? -1 : _elements[_end];

  public bool IsEmpty() => _count <= 0;

  public bool IsFull() => _count == _capacity;
}