Check if a queue can be sorted into another queue using a stack
Last Updated :
11 Feb, 2025
Given a Queue consisting of first n natural numbers (in random order). The task is to check whether the given Queue elements can be arranged in increasing order in another Queue using a stack. The operation allowed are:
- Push and pop elements from the stack
- Pop (Or Dequeue) from the given Queue.
- Push (Or Enqueue) in the another Queue.
Examples :
Input : Queue[] = { 5, 1, 2, 3, 4 }
Output : Yes
Pop the first element of the given Queue i.e 5.
Push 5 into the stack.
Now, pop all the elements of the given Queue and push them to
second Queue.
Now, pop element 5 in the stack and push it to the second Queue.
Input : Queue[] = { 5, 1, 2, 6, 3, 4 }
Output : No
Push 5 to stack.
Pop 1, 2 from given Queue and push it to another Queue.
Pop 6 from given Queue and push to stack.
Pop 3, 4 from given Queue and push to second Queue.
Now, from using any of above operation, we cannot push 5
into the second Queue because it is below the 6 in the stack.
Observe, second Queue (which will contain the sorted element) takes inputs (or enqueue elements) either from given Queue or Stack. So, the next expected (which will initially be 1) element must be present as a front element of a given Queue or top element of the Stack. So, simply simulate the process for the second Queue by initializing the expected element as 1. And check if we can get the expected element from the front of the given Queue or from the top of the Stack. If we cannot take it from either of them then pop the front element of the given Queue and push it in the Stack.
Also, observe, that the stack must also be sorted at each instance i.e the element at the top of the stack must be the smallest in the stack. For eg. let x > y, then x will always be expected before y. So, x cannot be pushed before y in the stack. Therefore, we cannot push an element with a higher value on the top of the element having a lesser value.
Algorithm:
- Initialize the expected_element = 1
- Check if either front element of given Queue or top element of the stack have expected_element
- If yes, increment expected_element by 1, repeat step 2.
- Else, pop front of Queue and push it to the stack. If the popped element is greater than top of the Stack, return "No".
Below is the implementation of this approach:
C++
// CPP Program to check if a queue of first
// n natural number can be sorted using a stack
#include <bits/stdc++.h>
using namespace std;
// Function to check if given queue element
// can be sorted into another queue using a
// stack.
bool checkSorted(int n, queue<int>& q)
{
stack<int> st;
int expected = 1;
int fnt;
// while given Queue is not empty.
while (!q.empty()) {
fnt = q.front();
q.pop();
// if front element is the expected element
if (fnt == expected)
expected++;
else {
// if stack is empty, push the element
if (st.empty()) {
st.push(fnt);
}
// if top element is less than element which
// need to be pushed, then return false.
else if (!st.empty() && st.top() < fnt) {
return false;
}
// else push into the stack.
else
st.push(fnt);
}
// while expected element are coming from
// stack, pop them out.
while (!st.empty() && st.top() == expected) {
st.pop();
expected++;
}
}
// if the final expected element value is equal
// to initial Queue size and the stack is empty.
if (expected - 1 == n && st.empty())
return true;
return false;
}
// Driven Program
int main()
{
queue<int> q;
q.push(5);
q.push(1);
q.push(2);
q.push(3);
q.push(4);
int n = q.size();
(checkSorted(n, q) ? (cout << "Yes") :
(cout << "No"));
return 0;
}
Java
// Java Program to check if a queue
// of first n natural number can
// be sorted using a stack
import java.io.*;
import java.util.*;
class GFG
{
static Queue<Integer> q =
new LinkedList<Integer>();
// Function to check if given
// queue element can be sorted
// into another queue using a stack.
static boolean checkSorted(int n)
{
Stack<Integer> st =
new Stack<Integer>();
int expected = 1;
int fnt;
// while given Queue
// is not empty.
while (q.size() != 0)
{
fnt = q.peek();
q.poll();
// if front element is
// the expected element
if (fnt == expected)
expected++;
else
{
// if stack is empty,
// push the element
if (st.size() == 0)
{
st.push(fnt);
}
// if top element is less than
// element which need to be
// pushed, then return false.
else if (st.size() != 0 &&
st.peek() < fnt)
{
return false;
}
// else push into the stack.
else
st.push(fnt);
}
// while expected element are
// coming from stack, pop them out.
while (st.size() != 0 &&
st.peek() == expected)
{
st.pop();
expected++;
}
}
// if the final expected element
// value is equal to initial Queue
// size and the stack is empty.
if (expected - 1 == n &&
st.size() == 0)
return true;
return false;
}
// Driver Code
public static void main(String args[])
{
q.add(5);
q.add(1);
q.add(2);
q.add(3);
q.add(4);
int n = q.size();
if (checkSorted(n))
System.out.print("Yes");
else
System.out.print("No");
}
}
// This code is contributed by
// Manish Shaw(manishshaw1)
Python
# Python Program to check if a queue of first
# n natural number can be sorted using a stack
from queue import Queue
# Function to check if given queue element
# can be sorted into another queue using a
# stack.
def checkSorted(n, q):
st = []
expected = 1
fnt = None
# while given Queue is not empty.
while (not q.empty()):
fnt = q.queue[0]
q.get()
# if front element is the
# expected element
if (fnt == expected):
expected += 1
else:
# if stack is empty, put the element
if (len(st) == 0):
st.append(fnt)
# if top element is less than element which
# need to be puted, then return false.
elif (len(st) != 0 and st[-1] < fnt):
return False
# else put into the stack.
else:
st.append(fnt)
# while expected element are coming
# from stack, pop them out.
while (len(st) != 0 and
st[-1] == expected):
st.pop()
expected += 1
# if the final expected element value is equal
# to initial Queue size and the stack is empty.
if (expected - 1 == n and len(st) == 0):
return True
return False
# Driver Code
if __name__ == '__main__':
q = Queue()
q.put(5)
q.put(1)
q.put(2)
q.put(3)
q.put(4)
n = q.qsize()
if checkSorted(n, q):
print("Yes")
else:
print("No")
# This code is contributed by PranchalK
C#
// C# Program to check if a queue
// of first n natural number can
// be sorted using a stack
using System;
using System.Linq;
using System.Collections.Generic;
class GFG
{
// Function to check if given
// queue element can be sorted
// into another queue using a stack.
static bool checkSorted(int n,
ref Queue<int> q)
{
Stack<int> st = new Stack<int>();
int expected = 1;
int fnt;
// while given Queue
// is not empty.
while (q.Count != 0)
{
fnt = q.Peek();
q.Dequeue();
// if front element is
// the expected element
if (fnt == expected)
expected++;
else
{
// if stack is empty,
// push the element
if (st.Count == 0)
{
st.Push(fnt);
}
// if top element is less than
// element which need to be
// pushed, then return false.
else if (st.Count != 0 &&
st.Peek() < fnt)
{
return false;
}
// else push into the stack.
else
st.Push(fnt);
}
// while expected element are
// coming from stack, pop them out.
while (st.Count != 0 &&
st.Peek() == expected)
{
st.Pop();
expected++;
}
}
// if the final expected element
// value is equal to initial Queue
// size and the stack is empty.
if (expected - 1 == n &&
st.Count == 0)
return true;
return false;
}
// Driver Code
static void Main()
{
Queue<int> q = new Queue<int>();
q.Enqueue(5);
q.Enqueue(1);
q.Enqueue(2);
q.Enqueue(3);
q.Enqueue(4);
int n = q.Count;
if (checkSorted(n, ref q))
Console.Write("Yes");
else
Console.Write("No");
}
}
// This code is contributed by
// Manish Shaw(manishshaw1)
JavaScript
// JavaScript Program to check if a queue
// of first n natural numbers can be sorted using a stack
let q = [];
// Function to check if given queue elements
// can be sorted into another queue using a stack.
function checkSorted(n) {
let st = [];
let expected = 1;
let fnt;
// While given queue is not empty
while (q.length !== 0) {
fnt = q.shift(); // Remove front element
// If front element is the expected element
if (fnt === expected) {
expected++;
} else {
// If stack is empty, push the element
if (st.length === 0) {
st.push(fnt);
}
// If top element is smaller than current element, return false
else if (st[st.length - 1] < fnt) {
return false;
} else {
st.push(fnt);
}
}
// While expected elements are coming from stack, pop them out
while (st.length !== 0 && st[st.length - 1] === expected) {
st.pop();
expected++;
}
}
// If the final expected element value is equal to initial queue size
// and the stack is empty, return true
return (expected - 1) === n && st.length === 0;
}
// Example queue
q.push(5);
q.push(1);
q.push(2);
q.push(3);
q.push(4);
let n = q.length;
console.log(checkSorted(n) ? "Yes" : "No");
Complexity Analysis:
- Time Complexity: O(n)
- Space Complexity: O(n)
Check if a queue can be sorted in another queue using a stack
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem