Queues: A Tale of Two Stacks
Problem Statement :
A queue is an abstract data type that maintains the order in which elements were added to it, allowing the oldest elements to be removed from the front and new elements to be added to the rear. This is called a First-In-First-Out (FIFO) data structure because the first element added to the queue (i.e., the one that has been waiting the longest) is always the first one to be removed. A basic queue has the following operations: Enqueue: add a new element to the end of the queue. Dequeue: remove the element from the front of the queue and return it. In this challenge, you must first implement a queue using two stacks. Then process q queries, where each query is one of the following 3 types: 1 x: Enqueue element into the end of the queue. 2: Dequeue the element at the front of the queue. 3: Print the element at the front of the queue. Function Description Complete the put, pop, and peek methods in the editor below. They must perform the actions as described above. Input Format The first line contains a single integer, q, the number of queries. Each of the next q lines contains a single query in the form described in the problem statement above. All queries start with an integer denoting the query type, but only query 1 is followed by an additional space-separated value, x, denoting the value to be enqueued. Constraints 1 <= q <= 10^5 1 <= type <= 3 1 <= | x | <= 10^9 It is guaranteed that a valid answer always exists for each query of types 2 and 3. Output Format For each query of type 3, return the value of the element at the front of the fifo queue on a new line.
Solution :
Solution in C :
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#define MAX 10000000
int queue[MAX];
int front = -1;
int rear = -1;
void enqueue(int num){
queue[++rear] = num;
}
void dequeue(){
front++;
}
void display(){
printf("%d\n",queue[front+1]);
}
int main() {
int n,i=0, choose,num;
scanf("%d",&n);
while(i<n){
scanf("%d",&choose);
switch(choose){
case 1:
scanf("%d", &num);
enqueue(num);
break;
case 2:
dequeue();
break;
case 3:
display();
break;
}
i++;
}
return 0;
}
Solution in C++ :
In C++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
class MyQueue {
public:
stack<int> stack_newest_on_top, stack_oldest_on_top;
void push(int x) {
stack_newest_on_top.push(x);
}
void pop() {
if (stack_oldest_on_top.empty()) {
// copy over and pop
while (!stack_newest_on_top.empty()) {
stack_oldest_on_top.push(stack_newest_on_top.top());
stack_newest_on_top.pop();
}
}
stack_oldest_on_top.pop();
}
int front() {
if (stack_oldest_on_top.empty()) {
// copy over and pop
while (!stack_newest_on_top.empty()) {
stack_oldest_on_top.push(stack_newest_on_top.top());
stack_newest_on_top.pop();
}
}
return stack_oldest_on_top.top();
}
};
int main() {
MyQueue q1;
int q, type, x;
cin >> q;
for(int i = 0; i < q; i++) {
cin >> type;
if(type == 1) {
cin >> x;
q1.push(x);
}
else if(type == 2) {
q1.pop();
}
else cout << q1.front() << endl;
}
return 0;
}
Solution in Java :
In Java :
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static class MyQueue<T> {
Stack<T> stack1 = new Stack<T>();
Stack<T> stack2 = new Stack<T>();
public void enqueue(T value) { // Push onto newest stack
stack1.push(value);
}
public T peek() {
if (stack2.isEmpty()) {
while (!stack1.isEmpty()) {
stack2.push(stack1.pop());
}
}
return stack2.peek();
}
public T dequeue() {
if (stack2.isEmpty()) {
while(!stack1.isEmpty()) {
stack2.push(stack1.pop());
}
}
return stack2.pop();
}
}
public static void main(String[] args) {
MyQueue<Integer> queue = new MyQueue<Integer>();
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
for (int i = 0; i < n; i++) {
int operation = scan.nextInt();
if (operation == 1) { // enqueue
queue.enqueue(scan.nextInt());
} else if (operation == 2) { // dequeue
queue.dequeue();
} else if (operation == 3) { // print/peek
System.out.println(queue.peek());
}
}
scan.close();
}
}
Solution in Python :
In Python3 :
class MyQueue(object):
def __init__(self):
self.items=[]
def peek(self):
i = self.items.pop()
self.items.append(i)
return i
def pop(self):
return self.items.pop()
def put(self, value):
self.items.insert(0, value)
queue = MyQueue()
t = int(input())
for line in range(t):
values = map(int, input().split())
values = list(values)
if values[0] == 1:
queue.put(values[1])
elif values[0] == 2:
queue.pop()
else:
print(queue.peek())
View More Similar Problems
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 →Unique Colors
You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti
View Solution →Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →Pair Sums
Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v
View Solution →Lazy White Falcon
White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi
View Solution →