# Leetcode 860 Solution

https://leetcode.com/problems/design-circular-queue

## Solution

``````class MyCircularQueue:

def __init__(self, k: int):
"""
Initialize your data structure here. Set the size of the queue to be k.
"""
self.a =  * k
self.k = k

self.length = 0

def enQueue(self, value: int) -> bool:
"""
Insert an element into the circular queue. Return true if the operation is successful.
"""
if self.length == self.k:
return False

self.a[(self.head + self.length) % self.k] = value
self.length += 1

return True

def deQueue(self) -> bool:
"""
Delete an element from the circular queue. Return true if the operation is successful.
"""
if self.length == 0:
return False

self.length -= 1

return True

def Front(self) -> int:
"""
Get the front item from the queue.
"""
if self.length == 0:
return -1

def Rear(self) -> int:
"""
Get the last item from the queue.
"""
if self.length == 0:
return -1
return self.a[(self.head + self.length - 1) % self.k]

def isEmpty(self) -> bool:
"""
Checks whether the circular queue is empty or not.
"""
return self.length == 0

def isFull(self) -> bool:
"""
Checks whether the circular queue is full or not.
"""
return self.length == self.k

# Your MyCircularQueue object will be instantiated and called as such:
# obj = MyCircularQueue(k)
# param_1 = obj.enQueue(value)
# param_2 = obj.deQueue()
# param_3 = obj.Front()
# param_4 = obj.Rear()
# param_5 = obj.isEmpty()
# param_6 = obj.isFull()
``````