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
Palindromic Subsets
Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t
View Solution →Counting On a Tree
Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n
View Solution →Polynomial Division
Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie
View Solution →Costly Intervals
Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the
View Solution →The Strange Function
One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting
View Solution →Self-Driving Bus
Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever
View Solution →