![](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FBzOut%2Fbtr8IJjwC74%2FOhBba1XEMHzyCC3NZHUpV0%2Fimg.png)
[leetcode-622] Design Circular Queue
ยท
๐ข One step
LeetCode-622 Design Circular Queue : Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle, and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer". note : You must solve the problem without using the built-in queue d..