{"id":10027,"date":"2022-09-27T10:29:55","date_gmt":"2022-09-27T10:29:55","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=10027"},"modified":"2022-10-10T09:31:26","modified_gmt":"2022-10-10T09:31:26","slug":"stack-permutations-check-if-an-array-is-stack-permutation-of-another","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/","title":{"rendered":"Stack Permutations (Check if an Array is Stack Permutation of Another)"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg\" alt=\"\" \/><\/p>\n<h3>Problem Statement:<\/h3>\n<p>You will be given 2 arrays. You have to tell whether the 2 arrays are stack permutations of each other or not. <\/p>\n<p>Basically, there will be 2 input arrays. You have 2 consider the first array as the input array and the second as the output array. You have to treat the input array as a queue and only dequeue operation is possible in the input array. Assume that there is a stack in which push and pop operations are allowed. Now, you have to tell whether we can generate the second array (output array) from the first <a href=\"https:\/\/prepbytes.com\/blog\/tag\/arrays\/\">array<\/a> by using the Stack.<\/p>\n<h3>Allowed Operations and Constraints<\/h3>\n<ul>\n<li>Only dequeue from the input queue.<\/li>\n<li>Push and pop operations in a single stack.<\/li>\n<li>Only enqueue in the output queue.<\/li>\n<li>The stack and input queue must be empty at the end.<\/li>\n<\/ul>\n<h3>Example<\/h3>\n<p>Let us say the following are the two input arrays.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183471695-1-01.png\" alt=\"\" \/><\/p>\n<p>Here, the second array is a stack permutation of the first array.<\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183499603-1-02.png\" alt=\"\" \/><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183516079-1-03.png\" alt=\"\" \/><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183530546-1-04.png\" alt=\"\" \/><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183541512-1-05.png\" alt=\"\" \/><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183554132-1-06.png\" alt=\"\" \/><\/p>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183563876-1-07.png\" alt=\"\" \/><\/p>\n<p>So, we got the output list. Hence these two arrays are stack permutable.<\/p>\n<h3>Approach<\/h3>\n<h3>Below is the algorithm that we will follow.<\/h3>\n<ul>\n<li>Create an empty stack.<\/li>\n<li>We have to pop elements from the input queue (array) and check if it is equal to the top of the output queue. If the element is equal to the top of the output queue, we will push the element into the stack.<\/li>\n<li>If we find an element in the input queue that is equal to the top of the output queue, we will pop an element from both the input and output queues and compare the top of the stack with the top of both the queues. If the tops are equal, then pop an element from the stack and input queue. Else, repeat step 2.<\/li>\n<li>We have to repeat the above steps until the first array becomes empty. At the last, the stack and the queue should both be empty. Else, the arrays are not stack permutable.<\/li>\n<\/ul>\n<p>Now that we have understood the algorithm, let us implement the above approach in a program.<\/p>\n<h3>Code Implementation<\/h3>\n\t\t\t\t\t\t<style>\r\n\t\t\t\t\r\n\t\t\t\t\t#tab_container_10028 {\r\n\toverflow:hidden;\r\n\tdisplay:block;\r\n\twidth:100%;\r\n\tborder:0px solid #ddd;\r\n\tmargin-bottom:30px;\r\n\t}\r\n\r\n#tab_container_10028 .tab-content{\r\n\tpadding:20px;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n\tmargin-top: 0px;\r\n\tbackground-color:#ffffff !important;\r\n\tcolor: #000000 !important;\r\n\tfont-size:16px !important;\r\n\tfont-family: Open Sans !important;\r\n\t\r\n\t\tborder: 1px solid #e6e6e6 !important;\r\n\t}\r\n#tab_container_10028 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_10028 .wpsm_nav-tabs > li.active > a, #tab_container_10028 .wpsm_nav-tabs > li.active > a:hover, #tab_container_10028 .wpsm_nav-tabs > li.active > a:focus {\r\n\tcolor: #000000 !important;\r\n\tcursor: default;\r\n\tbackground-color: #ffffff !important;\r\n\tborder: 1px solid #e6e6e6 !important;\r\n}\r\n\r\n#tab_container_10028 .wpsm_nav-tabs > li > a {\r\n    margin-right: 0px !important; \r\n    line-height: 1.42857143 !important;\r\n    border: 1px solid #d5d5d5 !important;\r\n    border-radius: 0px 0px 0 0 !important; \r\n\tbackground-color: #e8e8e8 !important;\r\n\tcolor: #000000 !important;\r\n\tpadding: 15px 18px 15px 18px !important;\r\n\ttext-decoration: none !important;\r\n\tfont-size: 14px !important;\r\n\ttext-align:center !important;\r\n\tfont-family: Open Sans !important;\r\n}\r\n#tab_container_10028 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_10028 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_10028 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_10028 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_10028 .wpsm_nav-tabs > li > a:hover , #tab_container_10028 .wpsm_nav-tabs > li > a:focus {\r\n    color: #000000 !important;\r\n    background-color: #e8e8e8 !important;\r\n\tborder: 1px solid #d5d5d5 !important;\r\n\t\r\n}\r\n#tab_container_10028 .wpsm_nav-tabs > li > a .fa{\r\n\r\nmargin-right:5px !important;\r\n\r\nmargin-left:5px !important;\r\n\r\n\r\n}\r\n\r\n\t\t#tab_container_10028 .wpsm_nav-tabs a{\r\n\t\t\tbackground-image: none;\r\n\t\t\tbackground-position: 0 0;\r\n\t\t\tbackground-repeat: repeat-x;\r\n\t\t}\r\n\t\t\t\r\n\r\n\r\n#tab_container_10028 .wpsm_nav-tabs > li {\r\n    float: left;\r\n    margin-bottom: -1px !important;\r\n\tmargin-right:0px !important; \r\n}\r\n\r\n\r\n#tab_container_10028 .tab-content{\r\noverflow:hidden !important;\r\n}\r\n\r\n\r\n@media (min-width: 769px) {\r\n\r\n\t#tab_container_10028 .wpsm_nav-tabs > li{\r\n\t\tfloat:left !important ;\r\n\t\t\t\tmargin-right:-1px !important;\r\n\t\t\t\t\t}\r\n\t#tab_container_10028 .wpsm_nav-tabs{\r\n\t\tfloat:none !important;\r\n\t\tmargin:0px !important;\r\n\t}\r\n\r\n\t#tab_container_10028 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_10028 .wpsm_nav{\r\n\t\t\t}\r\n\r\n}\r\n\r\n\r\n\r\n@media (max-width: 768px) {\r\n\t#tab_container_10028 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_10028 .wpsm_nav{\r\n\t\t\t}\r\n}\r\n\r\n\r\n\t.wpsm_nav-tabs li:before{\r\n\t\tdisplay:none !important;\r\n\t}\r\n\r\n\t@media (max-width: 768px) {\r\n\t\t\t\t\r\n\t\t\t\t.wpsm_nav-tabs{\r\n\t\t\tmargin-left:0px !important;\r\n\t\t\tmargin-right:0px !important; \r\n\t\t\t\r\n\t\t}\r\n\t\t\t\t#tab_container_10028 .wpsm_nav-tabs > li{\r\n\t\t\tfloat:none !important;\r\n\t\t}\r\n\t\t\t\r\n\t}\t\t\t\t<\/style>\r\n\t\t\t\t<div id=\"tab_container_10028\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_10028\">\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  class=\"active\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_10028_1\" aria-controls=\"tabs_desc_10028_1\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>C++<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t<li role=\"presentation\"  onclick=\"do_resize()\">\r\n\t\t\t\t\t\t\t\t<a href=\"#tabs_desc_10028_2\" aria-controls=\"tabs_desc_10028_2\" role=\"tab\" data-toggle=\"tab\">\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<i class=\"fa fa-code\"><\/i> \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t<span>Java<\/span>\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t<\/a>\r\n\t\t\t\t\t\t\t<\/li>\r\n\t\t\t\t\t\t\t\t\t\t\t <\/ul>\r\n\r\n\t\t\t\t\t  <!-- Tab panes -->\r\n\t\t\t\t\t  <div class=\"tab-content\" id=\"tab-content_10028\">\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane  in active \" id=\"tabs_desc_10028_1\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"cpp\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"cpp\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\n#include&lt;bits\/stdc++.h&gt;\r\nusing namespace std;\r\n\r\nbool checkStackPermutation(int ip[], int op[], int n)\r\n{\r\n\tqueue&lt;int&gt; input;\r\n\tfor (int i=0;i&lt;n;i++)\r\n\t\tinput.push(ip[i]);\r\n\r\n\tqueue&lt;int&gt; output;\r\n\tfor (int i=0;i&lt;n;i++)\r\n\t\toutput.push(op[i]);\r\n\r\n\tstack &lt;int&gt; tempStack;\r\n\twhile (!input.empty())\r\n\t{\r\n\t\tint ele = input.front();\r\n\t\tinput.pop();\r\n\t\tif (ele == output.front())\r\n\t\t{\r\n\t\t\toutput.pop();\r\n\t\t\twhile (!tempStack.empty())\r\n\t\t\t{\r\n\t\t\t\tif (tempStack.top() == output.front())\r\n\t\t\t\t{\r\n\t\t\t\t\ttempStack.pop();\r\n\t\t\t\t\toutput.pop();\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t\ttempStack.push(ele);\r\n\t}\r\n\r\n\treturn (input.empty()&amp;&amp;tempStack.empty());\r\n}\r\nint main()\r\n{\r\n\r\n\tint input[] = {1, 2, 3};\r\n\r\n\tint output[] = {2, 1, 3};\r\n\r\n\tint n = 3;\r\n\r\n\tif (checkStackPermutation(input, output, n))\r\n\t\tcout &lt;&lt; &quot;Yes&quot;;\r\n\telse\r\n\t\tcout &lt;&lt; &quot;Not Stack Permutable&quot;;\r\n\treturn 0;\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\t\t\t\t\t <div role=\"tabpanel\" class=\"tab-pane \" id=\"tabs_desc_10028_2\">\r\n\t\t\t\t\t\t\t\t<!-- wp:enlighter\/codeblock {\"language\":\"java\"} -->\r\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"java\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\r\nimport java.util.LinkedList;\r\nimport java.util.Queue;\r\nimport java.util.Stack;\r\n\r\nclass Gfg\r\n{\r\n\tstatic boolean checkStackPermutation(int ip[],\r\n\t\t\t\t\t\t\t\t\tint op[], int n)\r\n\t{\r\n\t\tQueue&lt;Integer&gt; input = new LinkedList&lt;&gt;();\r\n\r\n\t\tfor (int i = 0; i &lt; n; i++)\r\n\t\t{\r\n\t\t\tinput.add(ip[i]);\r\n\t\t}\r\n\r\n\t\tQueue&lt;Integer&gt; output = new LinkedList&lt;&gt;();\r\n\t\tfor (int i = 0; i &lt; n; i++)\r\n\t\t{\r\n\t\t\toutput.add(op[i]);\r\n\t\t}\r\n\r\n\t\tStack&lt;Integer&gt; tempStack = new Stack&lt;&gt;();\r\n\t\twhile (!input.isEmpty())\r\n\t\t{\r\n\t\t\tint ele = input.poll();\r\n\r\n\t\t\tif (ele == output.peek())\r\n\t\t\t{\r\n\t\t\t\toutput.poll();\r\n\t\t\t\twhile (!tempStack.isEmpty())\r\n\t\t\t\t{\r\n\t\t\t\t\tif (tempStack.peek() == output.peek())\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\ttempStack.pop();\r\n\t\t\t\t\t\toutput.poll();\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempStack.push(ele);\r\n\t\t\t}\r\n\t\t}\r\n    \treturn (input.isEmpty() &amp;&amp; tempStack.isEmpty());\r\n\t}\r\n    \r\n\tpublic static void main(String[] args)\r\n\t{\r\n\t\tint input[] = { 1, 2, 3 };\r\n\r\n\t\tint output[] = { 2, 1, 3 };\r\n\t\tint n = 3;\r\n\t\tif (checkStackPermutation(input, output, n))\r\n\t\t\tSystem.out.println(&quot;Yes&quot;);\r\n\t\telse\r\n\t\t\tSystem.out.println(&quot;Not Stack Permutable&quot;);\r\n\t}\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\t\t\t\t\t\t <\/div>\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t <\/div>\r\n\t\t\t\t\t \r\n\t\t\t\t <\/div>\r\n <script>\r\n\t\tjQuery(function () {\r\n\t\t\tjQuery('#myTab_10028 a:first').tab('show')\r\n\t\t});\r\n\t\t\r\n\t\t\t\tjQuery(function(){\r\n\t\t\tvar b=\"fadeIn\";\r\n\t\t\tvar c;\r\n\t\t\tvar a;\r\n\t\t\td(jQuery(\"#myTab_10028 a\"),jQuery(\"#tab-content_10028\"));function d(e,f,g){\r\n\t\t\t\te.click(function(i){\r\n\t\t\t\t\ti.preventDefault();\r\n\t\t\t\t\tjQuery(this).tab(\"show\");\r\n\t\t\t\t\tvar h=jQuery(this).data(\"easein\");\r\n\t\t\t\t\tif(c){c.removeClass(a);}\r\n\t\t\t\t\tif(h){f.find(\"div.active\").addClass(\"animated \"+h);a=h;}\r\n\t\t\t\t\telse{if(g){f.find(\"div.active\").addClass(\"animated \"+g);a=g;}else{f.find(\"div.active\").addClass(\"animated \"+b);a=b;}}c=f.find(\"div.active\");\r\n\t\t\t\t});\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\r\n\t\tfunction do_resize(){\r\n\r\n\t\t\tvar width=jQuery( '.tab-content .tab-pane iframe' ).width();\r\n\t\t\tvar height=jQuery( '.tab-content .tab-pane iframe' ).height();\r\n\r\n\t\t\tvar toggleSize = true;\r\n\t\t\tjQuery('iframe').animate({\r\n\t\t\t    width: toggleSize ? width : 640,\r\n\t\t\t    height: toggleSize ? height : 360\r\n\t\t\t  }, 250);\r\n\r\n\t\t\t  toggleSize = !toggleSize;\r\n\t\t}\r\n\r\n\r\n\t<\/script>\r\n\t\t\t\t\r\n\t\t\t\n<p><strong>Time Complexity:<\/strong> The time complexity of the above approach is O(N) as we have to traverse the first list completely and empty it to fill the output list.<\/p>\n<p><strong>Space Complexity (Auxiliary Space):<\/strong> It is also O(N) as we have to use an array as well as an output array of size N.<\/p>\n<p>We tried to discuss Stack Permutations. We hope this article gives you a better understanding of Stack Permutations, <a href=\"https:\/\/www.prepbytes.com\/\" title=\"PrepBytes\">PrepBytes<\/a> also provides a good collection of <a href=\"https:\/\/www.prepbytes.com\/prepbytes-courses\" title=\"Foundation Courses\">Foundation Courses<\/a> that can help you enhance your coding skills. Want to make sure you ace the interview in one go? Join our <a href=\"https:\/\/www.prepbytes.com\/placement-preparation-program\" title=\"Placement Program\">Placement Program<\/a> which will help you get prepared and land your dream job at MNCs. Mentors of Prepbytes are highly experienced and can provide you with basic, in-depth subject knowledge for better understanding.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Problem Statement: You will be given 2 arrays. You have to tell whether the 2 arrays are stack permutations of each other or not. Basically, there will be 2 input arrays. You have 2 consider the first array as the input array and the second as the output array. You have to treat the input [&hellip;]<\/p>\n","protected":false},"author":52,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[127],"tags":[],"class_list":["post-10027","post","type-post","status-publish","format-standard","hentry","category-stacks"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Stack Permutations (Check if an Array is Stack Permutation of Another) | PrepBytes Blog<\/title>\n<meta name=\"description\" content=\"We tried to discuss Stack Permutations. We hope this article gives you a better understanding of how to Check if an Array is Stack Permutation of Another.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Stack Permutations (Check if an Array is Stack Permutation of Another) | PrepBytes Blog\" \/>\n<meta property=\"og:description\" content=\"We tried to discuss Stack Permutations. We hope this article gives you a better understanding of how to Check if an Array is Stack Permutation of Another.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2022-09-27T10:29:55+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-10-10T09:31:26+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg\" \/>\n<meta name=\"author\" content=\"Prepbytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prepbytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/\"},\"author\":{\"name\":\"Prepbytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\"},\"headline\":\"Stack Permutations (Check if an Array is Stack Permutation of Another)\",\"datePublished\":\"2022-09-27T10:29:55+00:00\",\"dateModified\":\"2022-10-10T09:31:26+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/\"},\"wordCount\":490,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg\",\"articleSection\":[\"Stacks\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/\",\"name\":\"Stack Permutations (Check if an Array is Stack Permutation of Another) | PrepBytes Blog\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg\",\"datePublished\":\"2022-09-27T10:29:55+00:00\",\"dateModified\":\"2022-10-10T09:31:26+00:00\",\"description\":\"We tried to discuss Stack Permutations. We hope this article gives you a better understanding of how to Check if an Array is Stack Permutation of Another.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Stacks\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/stacks\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Stack Permutations (Check if an Array is Stack Permutation of Another)\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\",\"name\":\"Prepbytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"caption\":\"Prepbytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Stack Permutations (Check if an Array is Stack Permutation of Another) | PrepBytes Blog","description":"We tried to discuss Stack Permutations. We hope this article gives you a better understanding of how to Check if an Array is Stack Permutation of Another.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/","og_locale":"en_US","og_type":"article","og_title":"Stack Permutations (Check if an Array is Stack Permutation of Another) | PrepBytes Blog","og_description":"We tried to discuss Stack Permutations. We hope this article gives you a better understanding of how to Check if an Array is Stack Permutation of Another.","og_url":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2022-09-27T10:29:55+00:00","article_modified_time":"2022-10-10T09:31:26+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg","type":"","width":"","height":""}],"author":"Prepbytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Prepbytes","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/"},"author":{"name":"Prepbytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e"},"headline":"Stack Permutations (Check if an Array is Stack Permutation of Another)","datePublished":"2022-09-27T10:29:55+00:00","dateModified":"2022-10-10T09:31:26+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/"},"wordCount":490,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg","articleSection":["Stacks"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/","url":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/","name":"Stack Permutations (Check if an Array is Stack Permutation of Another) | PrepBytes Blog","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg","datePublished":"2022-09-27T10:29:55+00:00","dateModified":"2022-10-10T09:31:26+00:00","description":"We tried to discuss Stack Permutations. We hope this article gives you a better understanding of how to Check if an Array is Stack Permutation of Another.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664183576578-Topic.jpg"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/stack-permutations-check-if-an-array-is-stack-permutation-of-another\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Stacks","item":"https:\/\/prepbytes.com\/blog\/category\/stacks\/"},{"@type":"ListItem","position":3,"name":"Stack Permutations (Check if an Array is Stack Permutation of Another)"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e","name":"Prepbytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","caption":"Prepbytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/10027","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/52"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=10027"}],"version-history":[{"count":2,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/10027\/revisions"}],"predecessor-version":[{"id":10182,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/10027\/revisions\/10182"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=10027"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=10027"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=10027"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}