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
Balanced Forest
Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a
View Solution →Jenny's Subtrees
Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .
View Solution →Tree Coordinates
We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For
View Solution →Array Pairs
Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .
View Solution →Self Balancing Tree
An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ
View Solution →Array and simple queries
Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty
View Solution →