Queue using 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 x 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.
Input Format

The first line contains a single integer, q, denoting the number of queries.
Each line i of the q subsequent lines contains a single query in the form described in the problem statement above. All three 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.

Output Format

For each query of type 3, print the value of the element at the front of the queue on a new line.

Solution :


                            Solution in C :

In C ++ :

#include <iostream>
#include <stack>

using namespace std;

int main() 
  int q, type, value;
  char operation;
  stack<int> S1, S2;
  stack<char> S3, S4;
  cin >> q;
    cin >> type;
    if(type == 1)
      cin >> value;
    else if(type == 2)

  // Perform the actual operations.
    value = S1.top();

    value = S3.top();

    operation = S4.top();
    value = S2.top();

    if(operation == 'p')
      // Print.
      cout << value << endl;
      // Dequeue.

  return 0;

In Java :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        LinkedList<Integer> l = new LinkedList<>();
        int q = in.nextInt();
        while (q-- > 0) {
            int type = in.nextInt();
            if (type == 1) {
            else if (type == 2) {
                if (!l.isEmpty()) {
            else {

In C :


struct node{
	int data;
	struct node* next;

struct queue{
	struct node* head1;
	struct node* head2;

struct node* push(struct node* temp,int data){
	struct node* newnode = (struct node*)malloc(sizeof(struct node));
	newnode->data = data;
	newnode->next = temp;
	temp = newnode;
	return temp;

void enqueue(struct queue* q,int data){
	q->head1 = push(q->head1,data);

int pop(struct node** temp){
	int data = ( *temp )->data;
	(*temp) = (*temp)->next;
	return data;

void dequeue(struct queue*q){
	int x;
	if(q->head2 == NULL){
			x = pop( &(q->head1) );
			q->head2 = push(q->head2,x);
		x = pop(&(q->head2));
		x = pop(&(q->head2));		

void print(struct queue* q){
	int x;
			x = pop((&q->head1));
			q->head2 = push(q->head2,x);
	x = q->head2->data;

int main(void){
	int data,queries,choice;
	struct queue* q  = (struct queue*)malloc(sizeof(struct queue));
	q->head1 = q->head2 = NULL;
	for(int i = 0 ;i < queries ;i++){
		if(choice == 1){
		}else if(choice == 2){
		}else if(choice == 3){


In Python3 :

for q0 in range(q):
    li=[int(i) for i in input().strip().split()]
    if li[0]==1:
    elif li[0]==2:
        del qa[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 →