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

Kundu and Tree

Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that

View Solution →

Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →


We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →

No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →

Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →

Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →