{"id":7590,"date":"2025-07-07T21:11:05","date_gmt":"2025-07-07T15:41:05","guid":{"rendered":"https:\/\/namastedev.com\/blog\/?p=7590"},"modified":"2025-10-02T13:28:44","modified_gmt":"2025-10-02T07:58:44","slug":"implement-stack-using-one-queue","status":"publish","type":"post","link":"https:\/\/namastedev.com\/blog\/implement-stack-using-one-queue\/","title":{"rendered":"Implement Stack Using One Queue"},"content":{"rendered":"\n<!-- PrismJS for Syntax Highlighting -->\n<link\n    href=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/themes\/prism-tomorrow.min.css\"\n    rel=\"stylesheet\"\n\/>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/prism.min.js\"><\/script>\n<script src=\"https:\/\/cdn.jsdelivr.net\/npm\/prismjs@1.29.0\/plugins\/autoloader\/prism-autoloader.min.js\"><\/script>\n\n<style>\n.wp_blog_theme {\n  --primary: #E58C32;\n  --secondary: #030302;\n  --light-bg: #fef9f4;\n  --text-dark: #2d2d2d;\n  --tab-radius: 12px;\n  --shadow: 0 4px 12px rgba(0, 0, 0, 0.08);\n  --code-bg: #001f3f;\n  --code-text: #d4f1ff;\n}\n\n.wp_blog_container {\n  font-family: 'Segoe UI', sans-serif;\n  background: var(--light-bg);\n  margin: 0;\n  padding: 0;\n  color: var(--text-dark);\n}\n\n\/* Heading *\/\n.wp_blog_main-heading {\n  text-align: center;\n  font-size: 2.4rem;\n  color: var(--primary);\n  margin-top: 2.5rem;\n  font-weight: bold;\n}\n\n\/* Explanation Card *\/\n.wp_blog_explanation,\n.wp_blog_code-tabs-container {\n  max-width: 940px;\n  margin: 2rem auto;\n  padding: 2rem;\n  background: white;\n  border-radius: var(--tab-radius);\n  box-shadow: var(--shadow);\n}\n\n\/* Text and Visuals *\/\n.wp_blog_explanation h2 {\n  font-size: 1.4rem;\n  color: var(--primary);\n  margin-bottom: 0.5rem;\n}\n\n.wp_blog_explanation p,\n.wp_blog_explanation li {\n  font-size: 1.05rem;\n  line-height: 1.7;\n  margin: 0.5rem 0;\n}\n\n.wp_blog_explanation code {\n  background: #fef9f4;   \/* light bg instead of dark blue *\/\n  color: #E58C32;        \/* brand orange *\/\n  padding: 3px 6px;\n  border-radius: 4px;\n  font-family: 'Courier New', monospace;\n  font-weight: 600;      \/* optional, makes it pop *\/\n}\n\n.wp_blog_explanation img {\n  max-width: 100%;\n  border-radius: var(--tab-radius);\n  margin-top: 1rem;\n  box-shadow: 0 2px 12px rgba(0, 0, 0, 0.06);\n}\n\n\/* Tab Buttons *\/\n.wp_blog_code-tabs-header {\n  display: flex;\n  flex-wrap: wrap;\n  gap: 0.5rem;\n  margin-bottom: 1rem;\n}\n\n.wp_blog_code-tab-button {\n  padding: 0.6rem 1.2rem;\n  border: 1px solid var(--primary);\n  background: white;\n  color: var(--primary);\n  border-radius: 50px;\n  font-weight: 600;\n  cursor: pointer;\n  transition: all 0.3s ease;\n}\n\n.wp_blog_code-tab-button:hover {\n  background: var(--secondary);\n}\n\n.wp_blog_code-tab-button.active {\n  background: var(--primary);\n  color: white;\n}\n\n\/* Code Content *\/\n.wp_blog_code-tab-content {\n  display: none;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n}\n\n.wp_blog_code-tab-content.active {\n  display: block;\n}\n\n.wp_blog_code-tab-content pre {\n  margin: 0;\n  padding: 1.5rem;\n  font-size: 1rem;\n  overflow-x: auto;\n  background: var(--code-bg);\n  border-radius: var(--tab-radius);\n  color: var(--code-text);\n}\n\n\/* Dark mode variables *\/\n.wp_blog_theme.dark-mode {\n  --light-bg: #121212;\n  --text-dark: #f5f5f5;\n  --shadow: 0 4px 12px rgba(255, 255, 255, 0.08);\n  --code-bg: #1e1e1e;\n  --code-text: #c5f0ff;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_explanation {\n  background: #1e1e1e;\n}\n\n\/* Dark mode code highlight *\/\n.wp_blog_theme.dark-mode .wp_blog_explanation code {\n  background: #333;\n  color: #ffd27f;\n}\n\n.wp_blog_theme {\n  position: relative; \/* makes it the reference for absolute children *\/\n}\n\n.wp_blog_toggle-btn {\n  position: absolute;\n  top: 1rem;\n  right: 1rem;\n  z-index: 9999;\n  padding: 0.5rem 0.8rem;\n  border-radius: 10%;\n  background: var(--primary);\n  color: white;\n  font-weight: bold;\n  cursor: pointer;\n  border: none;\n  box-shadow: var(--shadow);\n  transition: background 0.3s, transform 0.2s;\n}\n\n.wp_blog_toggle-btn:hover {\n  background: #cc772e;\n}\n\n.wp_blog_theme.dark-mode .wp_blog_code-tabs-container {\n  background: #1e1e1e;\n}\n<\/style>\n\n<div class=\"wp_blog_container wp_blog_theme\">\n                <button id=\"blogNotesThemeToggle\" class=\"wp_blog_toggle-btn\">\ud83c\udf19<\/button>\n<h1 class=\"wp_blog_main-heading\"><\/h1>\n\n<div class=\"wp_blog_explanation\">\n    <h2>Problem Statement:<\/h2>\n    <p>\n       Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (<code>push<\/code>, <code>top<\/code>, <code>pop<\/code>, and <code>empty<\/code>).\n    <\/p>\n\n    <p>Implement the <code>MyStack<\/code> class:<\/p>\n    <p>\n       <ul>\n        <li><code>void push(int x)<\/code>Pushes element x to the top of the stack.<\/li>\n        <li><code>int pop()<\/code>Removes the element on the top of the stack and returns it..<\/li>\n        <li><code>int top()<\/code>Returns the element on the top of the stack.<\/li>\n        <li><code>boolean empty()<\/code>Returns true if the stack is empty, <code>false<\/code> otherwise.<\/li>\n       <\/ul>\n    <\/p>\n\n    <p><strong>Notes<\/strong>\n    <ul>\n        <li>You must use only standard operations of a queue, which means that only <code>push to back<\/code>, <code>peek\/pop from front<\/code>, <code>size<\/code> and <code>is empty<\/code> operations are valid.<\/li>\n        <li>Depending on your language, the queue may not be supported natively. You may simulate a queue using a list or deque (double-ended queue) as long as you use only a queue&#8217;s standard operations.<\/li>\n    <\/ul>\n    <\/p>\n    <h2>Examples<\/h2>\n    <p><strong>Example 1:<\/strong><\/p>\n    <p><strong>Input:<\/strong>[&#8220;MyStack&#8221;, &#8220;push&#8221;, &#8220;push&#8221;, &#8220;top&#8221;, &#8220;pop&#8221;, &#8220;empty&#8221;]\n    [[], [1], [2], [], [], []]<\/p>\n    <p><strong>Output:<\/strong><code>[null, null, null, 2, 2, false]<\/code><\/p>\n    <p><strong>Explanation<\/strong>\n    MyStack myStack = new MyStack();\n    myStack.push(1);\n    myStack.push(2);\n    myStack.top(); \/\/ return 2\n    myStack.pop(); \/\/ return 2\n    myStack.empty(); \/\/ return False\n    <\/p>\n    <h2>Constraints:<\/h2>\n    <ul>\n        <li>1 <= x <= 9<\/li>\n        <li>At most <code>100<\/code> calls will be made to <code>push<\/code>, <code>pop<\/code>, <code>top<\/code>, and <code>empty<\/code>.<\/li>\n        <li>All the calls to <code>pop<\/code> and <code>top<\/code>are valid.<\/li>\n    <\/ul>\n\n    <p>\n        <strong>Follow-up<\/strong>:\n        Can you implement the stack using only one queue?\n    <\/p>\n\n    <h2>Approach: Implement Stack Using One Queue<\/h2>\n    <ul>\n        <li>\n            We simulate LIFO (stack) using only FIFO (queue) operations.\n        <\/li>\n\n        <li>\n            We maintain a single queue (q).\n        <\/li>\n\n        <li>\n            Remove the last pushed element (i.e., rear of q1).\n            <ul>\n                <li>Insert it at the back (q.push(x)).<\/li>\n                <li>Rotate the queue to bring the new element to the front by dequeuing and enqueuing all previous elements.<\/li>\n            <\/ul>\n        <\/li>\n    <\/ul>\n\n    <h2>Visualisation:<\/h2>\n    <img decoding=\"async\"\n        src=\"https:\/\/namastedev.com\/blog\/wp-content\/uploads\/2025\/07\/Screenshot-2025-07-07-at-9.08.56\u202fPM.png\"\n        alt=\"stack\"\n    \/>\n                <h2>Time Complexity:<\/h2>\n                <li>\n                  <p><strong>push \u2192 O(n)<\/strong><\/p>\n                  <p><strong>pop \u2192 O(1)<\/strong><\/p>\n                  <p><strong>top \u2192 O(1)<\/strong><\/p>\n                  <p><strong>empty  \u2192 O(1)<\/strong><\/p>\n                    <\/li> \n                <h2>Space Complexity:<\/h2>\n                <li>\n                  <p><strong>Space Complexity = O(n)<\/strong>\n                <li>Where n is the total number of elements in the stack.<\/li>  \n                <\/p>\n                <\/li>\n\n<h2>Dry Run<\/h2>\n<div style=\"background: var(--light-bg); border-left: 4px solid var(--primary); padding: 1rem; border-radius: var(--tab-radius); margin: 1rem 0; color: var(--text-dark);\">\n  <p><strong>Input:<\/strong><\/p>\n  <pre style=\"white-space: pre-wrap; background: var(--code-bg); padding: 1rem; border-radius: 8px; overflow-x: auto; color: var(--code-text);\">\nOperations:\npush(1)\npush(2)\npush(3)\ntop()\npop()\ntop()\nempty()\n  <\/pre>\n\n  <p><strong>State Transitions:<\/strong><\/p>\n  <pre style=\"white-space: pre-wrap; background: var(--code-bg); padding: 1rem; border-radius: 8px; overflow-x: auto; color: var(--code-text);\">\nAfter push(1):\n  q = [1]\n\nAfter push(2):\n  q = [1, 2]\n\nAfter push(3):\n  q = [1, 2, 3]\n\ntop():\n  Loop to rotate first n-1 = 2 elements:\n    q.push(q.shift()) \u2192 q = [2, 3, 1]\n    q.push(q.shift()) \u2192 q = [3, 1, 2]\n  Peek front = 3\n  Push front back \u2192 q = [1, 2, 3]\n  \u2192 Returns: 3\n\npop():\n  Loop to rotate first n-1 = 2 elements:\n    q.push(q.shift()) \u2192 q = [2, 3, 1]\n    q.push(q.shift()) \u2192 q = [3, 1, 2]\n  Remove front = 3 \u2192 q = [1, 2]\n  \u2192 Returns: 3\n\ntop():\n  Loop to rotate first n-1 = 1 element:\n    q.push(q.shift()) \u2192 q = [2, 1]\n  Peek front = 2\n  Push front back \u2192 q = [1, 2]\n  \u2192 Returns: 2\n\nempty():\n  q = [1, 2] \u2192 Not empty\n  \u2192 Returns: false\n  <\/pre>\n\n  <p><strong>Final State:<\/strong> <code>q = [1, 2]<\/code>, <code>Stack (top to bottom): [2, 1]<\/code><\/p>\n<\/div>\n\n<\/div>\n\n<div class=\"wp_blog_code-tabs-container\">\n    <div class=\"wp_blog_code-tabs-header\">\n        <button class=\"wp_blog_code-tab-button active\" data-lang=\"js\">\n            JavaScript\n        <\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"py\">Python<\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"java\">Java<\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"cpp\">C++<\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"c\">C<\/button>\n        <button class=\"wp_blog_code-tab-button\" data-lang=\"cs\">C#<\/button>\n    <\/div>\n\n    <div class=\"wp_blog_code-tab-content active\" data-lang=\"js\">\n<pre><code class=\"language-javascript\">\nvar MyStack = function() {\n    this.q = []; \n};\n\nMyStack.prototype.push = function(x) {\n    this.q.push(x);\n};\n\nMyStack.prototype.pop = function() {\n    let n = this.q.length;\n    for (let i = 0; i < n - 1; i++) {\n        this.q.push(this.q.shift());\n    }\n    return this.q.shift();\n};\n\nMyStack.prototype.top = function() {\n    let n = this.q.length;\n    for (let i = 0; i < n - 1; i++) {\n        this.q.push(this.q.shift());\n    }\n    let front = this.q.shift();\n    this.q.push(front);\n    return front;\n};\n\nMyStack.prototype.empty = function() {\n    return this.q.length === 0;\n};\n<\/code><\/pre>\n\n<\/div>\n\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"py\">\n        <pre><code class=\"language-python\">\nfrom collections import deque\n\nclass MyStack:\n    def __init__(self):\n        self.q = deque()\n\n    def push(self, x: int) -> None:\n        self.q.append(x)\n\n    def pop(self) -> int:\n        for _ in range(len(self.q) - 1):\n            self.q.append(self.q.popleft())\n        return self.q.popleft()\n\n    def top(self) -> int:\n        for _ in range(len(self.q) - 1):\n            self.q.append(self.q.popleft())\n        front = self.q.popleft()\n        self.q.append(front)\n        return front\n\n    def empty(self) -> bool:\n        return len(self.q) == 0\n\n    <\/code><\/pre>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"java\">\n        <pre><code class=\"language-java\">\nimport java.util.LinkedList;\nimport java.util.Queue;\n\nclass MyStack {\n    Queue<Integer> q = new LinkedList<>();\n\n    public void push(int x) {\n        q.offer(x);\n    }\n\n    public int pop() {\n        int n = q.size();\n        for (int i = 0; i < n - 1; i++) {\n            q.offer(q.poll());\n        }\n        return q.poll();\n    }\n\n    public int top() {\n        int n = q.size();\n        for (int i = 0; i < n - 1; i++) {\n            q.offer(q.poll());\n        }\n        int front = q.poll();\n        q.offer(front);\n        return front;\n    }\n\n    public boolean empty() {\n        return q.isEmpty();\n    }\n}\n <\/code><\/pre>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"cpp\">\n        <pre><code class=\"language-cpp\">\n#include &lt;queue&gt;\nclass MyStack {\n    std::queue<int> q;\npublic:\n    void push(int x) {\n        q.push(x);\n    }\n\n    int pop() {\n        int n = q.size();\n        for (int i = 0; i < n - 1; ++i) {\n            q.push(q.front());\n            q.pop();\n        }\n        int top = q.front();\n        q.pop();\n        return top;\n    }\n\n    int top() {\n        int n = q.size();\n        for (int i = 0; i < n - 1; ++i) {\n            q.push(q.front());\n            q.pop();\n        }\n        int top = q.front();\n        q.pop();\n        q.push(top);\n        return top;\n    }\n\n    bool empty() {\n        return q.empty();\n    }\n};\n    <\/code><\/pre>\n    <\/div>\n\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"c\">\n        <pre><code class=\"language-c\">\n#include &lt;stdio.h&gt;\n#include &lt;stdbool.h&gt;\n#include &lt;stdlib.h&gt;\n\n#define MAX 1000\n\ntypedef struct {\n    int data[MAX];\n    int front;\n    int rear;\n    int size;\n} Queue;\n\nvoid initQueue(Queue* q) {\n    q->front = 0;\n    q->rear = 0;\n    q->size = 0;\n}\n\nvoid enqueue(Queue* q, int val) {\n    if (q->size == MAX) {\n        printf(\"Queue overflow\\n\");\n        return;\n    }\n    q->data[q->rear] = val;\n    q->rear = (q->rear + 1) % MAX;\n    q->size++;\n}\n\nint dequeue(Queue* q) {\n    if (q->size == 0) {\n        printf(\"Queue underflow\\n\");\n        return -1;\n    }\n    int val = q->data[q->front];\n    q->front = (q->front + 1) % MAX;\n    q->size--;\n    return val;\n}\n\nint queueSize(Queue* q) {\n    return q->size;\n}\n\nbool isQueueEmpty(Queue* q) {\n    return q->size == 0;\n}\n\n\/\/ MyStack implementation using one queue\ntypedef struct {\n    Queue q;\n} MyStack;\n\nvoid myStackInit(MyStack* obj) {\n    initQueue(&obj->q);\n}\n\nvoid myStackPush(MyStack* obj, int x) {\n    enqueue(&obj->q, x);\n}\n\nint myStackPop(MyStack* obj) {\n    int n = queueSize(&obj->q);\n    for (int i = 0; i < n - 1; i++) {\n        enqueue(&#038;obj->q, dequeue(&obj->q));\n    }\n    return dequeue(&obj->q);\n}\n\nint myStackTop(MyStack* obj) {\n    int n = queueSize(&obj->q);\n    for (int i = 0; i < n - 1; i++) {\n        enqueue(&#038;obj->q, dequeue(&obj->q));\n    }\n    int top = dequeue(&obj->q);\n    enqueue(&obj->q, top);\n    return top;\n}\n\nbool myStackEmpty(MyStack* obj) {\n    return isQueueEmpty(&obj->q);\n}\n\/\/ Example usage\nint main() {\n    MyStack s;\n    myStackInit(&s);\n\n    myStackPush(&s, 10);\n    myStackPush(&s, 20);\n    myStackPush(&s, 30);\n\n    printf(\"Top: %d\\n\", myStackTop(&s)); \/\/ 30\n    printf(\"Pop: %d\\n\", myStackPop(&s)); \/\/ 30\n    printf(\"Top after pop: %d\\n\", myStackTop(&s)); \/\/ 20\n    printf(\"Is empty? %s\\n\", myStackEmpty(&s) ? \"Yes\" : \"No\"); \/\/ No\n\n    return 0;\n}\n    <\/code><\/pre>\n    <\/div>\n    <div class=\"wp_blog_code-tab-content\" data-lang=\"cs\">\n        <pre><code class=\"language-csharp\">\nusing System.Collections.Generic;\n\npublic class MyStack {\n    private Queue<int> q = new Queue<int>();\n\n    public void Push(int x) {\n        q.Enqueue(x);\n    }\n\n    public int Pop() {\n        int n = q.Count;\n        for (int i = 0; i < n - 1; i++) {\n            q.Enqueue(q.Dequeue());\n        }\n        return q.Dequeue();\n    }\n\n    public int Top() {\n        int n = q.Count;\n        for (int i = 0; i < n - 1; i++) {\n            q.Enqueue(q.Dequeue());\n        }\n        int front = q.Dequeue();\n        q.Enqueue(front);\n        return front;\n    }\n\n    public bool Empty() {\n        return q.Count == 0;\n    }\n}\n  <\/code><\/pre>\n    <\/div>\n<\/div>\n<\/div>\n<script>\ndocument.addEventListener(\"DOMContentLoaded\", () => {\n  const buttons = document.querySelectorAll(\".wp_blog_code-tab-button\");\n  const contents = document.querySelectorAll(\".wp_blog_code-tab-content\");\n\n  buttons.forEach((button) => {\n    button.addEventListener(\"click\", () => {\n      const lang = button.getAttribute(\"data-lang\");\n\n      buttons.forEach((btn) => btn.classList.remove(\"active\"));\n      contents.forEach((content) => content.classList.remove(\"active\"));\n\n      button.classList.add(\"active\");\n      document\n        .querySelector(`.wp_blog_code-tab-content[data-lang=\"${lang}\"]`)\n        .classList.add(\"active\");\n    });\n  });\n\n  const themeToggle = document.getElementById(\"blogNotesThemeToggle\");\n  const themeContainer = document.querySelector(\".wp_blog_theme\");\n\n  themeToggle.addEventListener(\"click\", () => {\n    themeContainer.classList.toggle(\"dark-mode\");\n    themeToggle.textContent =\n      themeContainer.classList.contains(\"dark-mode\") ? \"\u2600\ufe0f\" : \"\ud83c\udf19\";\n  });\n});\n<\/script>\n","protected":false},"excerpt":{"rendered":"<p>\ud83c\udf19 Problem Statement: Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty). Implement the MyStack class: void push(int x)Pushes element x to the top of the stack. int pop()Removes the element on the top of the stack and<\/p>\n","protected":false},"author":108,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[322,260,176,175,811,810,174,172,173],"tags":[],"class_list":{"0":"post-7590","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-algorithms-and-data-structures","7":"category-c-c-plus-plus","8":"category-csharp","9":"category-cplusplus","10":"category-data-structures-and-algorithms","11":"category-dsa","12":"category-java","13":"category-javascript","14":"category-python"},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7590","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/users\/108"}],"replies":[{"embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/comments?post=7590"}],"version-history":[{"count":2,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7590\/revisions"}],"predecessor-version":[{"id":10208,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/posts\/7590\/revisions\/10208"}],"wp:attachment":[{"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/media?parent=7590"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/categories?post=7590"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/namastedev.com\/blog\/wp-json\/wp\/v2\/tags?post=7590"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}