**Circular Queue - Amazon Top Interview Questions**

### Problem Statement :

Implement a circular queue with the following methods: CircularQueue(int capacity) which creates an instance of a circular queue with size capacity. Circular queues are implemented using an array which holds the enqueued values with pointers pointing to the start and end of the queue. When the queue reaches the end of the array, it will start to fill items from the start of the array if they were dequeued. boolean enqueue(int val) which adds val to the queue if it has space. If the queue is full, return false to denote it can't be added and return true otherwise. boolean dequeue() which removes the first element that was enqueued. If the queue is empty, return false to denote it can't be removed and return true otherwise. int front() which returns the first element that was enqueued. If the queue is empty, return -1. int top() which returns the last element that was enqueued. If the queue is empty, return -1. boolean isFull() which returns whether the queue has capacity elements. boolean isEmpty() which returns whether the queue has no elements. Constraints 0 ≤ n ≤ 100,000 where n is the number of calls to the queue Example 1 Input methods = ["constructor", "enqueue", "enqueue", "enqueue", "top", "front", "isFull", "isEmpty", "dequeue", "enqueue", "dequeue", "dequeue", "dequeue", "isEmpty"] arguments = [[3], [1], [2], [3], [], [], [], [], [], [4], [], [], [], []]` Output [None, True, True, True, 3, 1, True, False, True, True, True, True, True, True] Explanation q = CircularQueue(3) q.enqueue(1) q.enqueue(2) q.enqueue(3) q.top() == 3 q.front() == 1 q.isFull() == True q.isEmpty() == False q.dequeue() == True q.enqueue(4) == True q.dequeue() == True q.dequeue() == True q.dequeue() == True q.isEmpty() == True

### Solution :

` ````
Solution in C++ :
class CircularQueue {
public:
vector<int> arr;
int i, j, n, total;
CircularQueue(int capacity) {
arr.resize(capacity);
i = j = total = 0;
n = capacity;
}
bool enqueue(int val) {
if (isFull()) return false;
total += 1;
arr[i] = val;
i = (i + 1) % n;
return true;
}
bool dequeue() {
if (isEmpty()) return false;
j = (j + 1) % n;
total -= 1;
return true;
}
int front() {
if (isEmpty()) return -1;
return arr[j];
}
int top() {
if (isEmpty()) return -1;
return arr[(i - 1 + n) % n];
}
bool isFull() {
return total == n ? true : false;
}
bool isEmpty() {
return total == 0 ? true : false;
}
};
```

` ````
Solution in Python :
class CircularQueue:
def __init__(self, capacity):
self.arr = [0] * capacity
self.n = capacity
self.front_idx = 0
self.total = 0
def enqueue(self, val):
if self.isFull():
return False
self.arr[(self.front_idx + self.total) % self.n] = val
self.total += 1
return True
def dequeue(self):
if self.isEmpty():
return False
self.front_idx += 1
self.front_idx %= self.n
self.total -= 1
return True
def front(self):
if self.isEmpty():
return -1
return self.arr[self.front_idx]
def top(self):
if self.isEmpty():
return -1
return self.arr[(self.front_idx + self.total - 1) % self.n]
def isFull(self):
return self.total == self.n
def isEmpty(self):
return self.total == 0
```

## View More Similar Problems

## Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

View Solution →## Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

View Solution →## Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

View Solution →## Print the Elements of a Linked List

This is an to practice traversing a linked list. Given a pointer to the head node of a linked list, print each node's data element, one per line. If the head pointer is null (indicating the list is empty), there is nothing to print. Function Description: Complete the printLinkedList function in the editor below. printLinkedList has the following parameter(s): 1.SinglyLinkedListNode

View Solution →## Insert a Node at the Tail of a Linked List

You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Input Format: You have to complete the SinglyLink

View Solution →## Insert a Node at the head of a Linked List

Given a pointer to the head of a linked list, insert a new node before the head. The next value in the new node should point to head and the data value should be replaced with a given value. Return a reference to the new head of the list. The head pointer given may be null meaning that the initial list is empty. Function Description: Complete the function insertNodeAtHead in the editor below

View Solution →