{"id":9977,"date":"2022-09-26T11:54:39","date_gmt":"2022-09-26T11:54:39","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9977"},"modified":"2022-10-10T09:17:40","modified_gmt":"2022-10-10T09:17:40","slug":"program-for-tower-of-hanoi","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/","title":{"rendered":"Program for Tower of Hanoi"},"content":{"rendered":"<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg\" alt=\"\" \/><\/p>\n<h3>Problem statement<\/h3>\n<p>In the Tower of Hanoi problem you are given three rods (\u201cSource\u201d, \u201cDestination\u201d, \u201cAuxiliary\u201d) and n disks. Initially, all the disks are stacked on the source rod in decreasing order of the disk\u2019s size making a conical shape. Your task is to move all the stacked disks to the destination rod by obeying the following rules:<\/p>\n<ol>\n<li>You can move only one disk in one step.<\/li>\n<li>The topmost disk can be removed from any rod and placed on top of the other rod.<\/li>\n<li>A disk can not be placed on another disk that is smaller in size than it.<\/li>\n<\/ol>\n<h3>Test cases:<\/h3>\n<p><strong>Input<\/strong>:<br \/>\n2<\/p>\n<p><strong>Output<\/strong>:<br \/>\nMove Disk 1 from \u201cS\u201d to \u201cA\u201d<br \/>\nMove Disk 2 from \u201cS\u201d to \u201cD\u201d<br \/>\nMove Disk 1 from \u201cA\u201d to \u201cD\u201d<\/p>\n<h3>Explanation:<\/h3>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158305500-1.png\" alt=\"\" \/><\/p>\n<h3>Recursive Approach:<\/h3>\n<h3>Algorithm:<\/h3>\n<p>We will use the auxiliary rod to reach the destination using recursion. The recurrence formula follows:<\/p>\n<ol>\n<li>Move \u2018n-1\u2019 disks from the source rod to the Auxillary rod using the destination rod.<\/li>\n<li>Move the nth disk from the source rod to the destination rod.<\/li>\n<li>Move \u2018n-1\u2019 disks from the auxiliary rod to the destination rod using the source rod.<\/li>\n<\/ol>\n<h3>Dry Run:<\/h3>\n<p><img decoding=\"async\" src=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664193237535-2.png\" alt=\"\" \/><\/p>\n<h3>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_9958 {\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_9958 .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_9958 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_9958 .wpsm_nav-tabs > li.active > a, #tab_container_9958 .wpsm_nav-tabs > li.active > a:hover, #tab_container_9958 .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_9958 .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_9958 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_9958 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_9958 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_9958 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_9958 .wpsm_nav-tabs > li > a:hover , #tab_container_9958 .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_9958 .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_9958 .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_9958 .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_9958 .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_9958 .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_9958 .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_9958 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_9958 .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_9958 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_9958 .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_9958 .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_9958\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_9958\">\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_9958_1\" aria-controls=\"tabs_desc_9958_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>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_9958\">\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_9958_1\">\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\npublic class Prepbytes\r\n{\r\n\tpublic static void main(String[] args) {\r\n\t\ttowerofhanoi(3, &quot;S&quot;, &quot;D&quot;, &quot;A&quot;);\r\n\t}\r\n\tpublic static void towerofhanoi(int disks, String src, String dst, String temp){\r\n\t    if (disks == 1){\r\n\t        System.out.println(&quot;Move disk &quot; + disks + &quot; from &quot;+ src + &quot; to &quot; + dst);\r\n\t    }\r\n\t    \r\n\t    else {\r\n\t        towerofhanoi(disks - 1, src, temp, dst);\r\n\t        System.out.println(&quot;Move disk &quot; + disks + &quot; from &quot;+ src + &quot; to &quot; + dst);\r\n\t        towerofhanoi(disks - 1, temp, dst, src);\r\n\t    }\r\n\t}\r\n}\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\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_9958 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_9958 a\"),jQuery(\"#tab-content_9958\"));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>Output<\/strong>:<br \/>\nMove disk 1 from S to D<br \/>\nMove disk 2 from S to A<br \/>\nMove disk 1 from D to A<br \/>\nMove disk 3 from S to D<br \/>\nMove disk 1 from A to S<br \/>\nMove disk 2 from A to D<br \/>\nMove disk 1 from S to D<\/p>\n<p><strong>Time complexity<\/strong>: O(2n). The minimum number of moves required is 2n.<br \/>\n<strong>Space Complexity<\/strong>: O(n). We have to store at most n disks in the recursive <a href=\"https:\/\/prepbytes.com\/blog\/category\/stacks\/\">stack<\/a>..<\/p>\n<h3>Iterative Approach<\/h3>\n<h3>Algorithm<\/h3>\n<ol>\n<li>Find the total number of moves required to solve the problem. If the number of disks is n, then the total moves required is 2n &#8211; 1.<\/li>\n<li>If n % 2 == 0, i.e, n is even then exchange the position of the destination rod and auxiliary rod.<\/li>\n<li>Iterate i in 1 to moves<br \/>\na. if i % 3 == 1:<br \/>\ni. Move the topmost disk of the source pole and place it on the top of the destination pole.<br \/>\nb. If i%3 == 2:<br \/>\ni. Move the topmost disk of the source pole and place it on the top of the auxiliary pole.<br \/>\nc. If i%3 == 0:<br \/>\ni. Move the topmost disk of the auxiliary pole and place it on the top of the destination pole.<\/li>\n<\/ol>\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_9959 {\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_9959 .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_9959 .wpsm_nav-tabs {\r\n    border-bottom: 0px solid #ddd;\r\n}\r\n#tab_container_9959 .wpsm_nav-tabs > li.active > a, #tab_container_9959 .wpsm_nav-tabs > li.active > a:hover, #tab_container_9959 .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_9959 .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_9959 .wpsm_nav-tabs > li > a:focus {\r\noutline: 0px !important;\r\n}\r\n\r\n#tab_container_9959 .wpsm_nav-tabs > li > a:before {\r\n\tdisplay:none !important;\r\n}\r\n#tab_container_9959 .wpsm_nav-tabs > li > a:after {\r\n\tdisplay:none !important ;\r\n}\r\n#tab_container_9959 .wpsm_nav-tabs > li{\r\npadding:0px !important ;\r\nmargin:0px;\r\n}\r\n\r\n#tab_container_9959 .wpsm_nav-tabs > li > a:hover , #tab_container_9959 .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_9959 .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_9959 .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_9959 .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_9959 .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_9959 .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_9959 .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_9959 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_9959 .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_9959 .wpsm_nav-tabs > li {\r\n\t\t\t\t\r\n\t}\r\n\t#tab_container_9959 .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_9959 .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_9959\" >\r\n\t \r\n\t\t\t\t\t<ul class=\"wpsm_nav wpsm_nav-tabs\" role=\"tablist\" id=\"myTab_9959\">\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_9959_1\" aria-controls=\"tabs_desc_9959_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>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_9959\">\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_9959_1\">\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\npublic class TowerOfHanoi{\r\n\t\r\n\/\/ Stack Class\r\nclass Stack\r\n{\r\n\tint capacity;\r\n\tint top;\r\n\tint array[];\r\n}\r\n\r\n\/\/ This function will create a new stack of the given capacity\r\nStack initStack(int capacity)\r\n{\r\n\tStack st = new Stack();\r\n\tst.capacity = capacity;\r\n\tst.top = -1;\r\n\tst.array = new int[capacity];\r\n\treturn st;\r\n}\r\n\r\n\/\/ This function checks whether the stack is full or not\r\nboolean isFull(Stack st)\r\n{\r\n\treturn (st.top == st.capacity - 1);\r\n}\r\n\r\n\/\/ This function checks whether the stack is empty or not\r\nboolean isEmpty(Stack st)\r\n{\r\n\treturn (st.top == -1);\r\n}\r\n\r\n\/\/ This function adds this item to the stack.\r\nvoid push(Stack st, int item)\r\n{\r\n\tif (isFull(st)) {\r\n\t\treturn;\r\n\t}\r\n\t\t\r\n\tst.array[++st.top] = item;\r\n}\r\n\r\n\/\/ This function removes the top of the stack.\r\nint pop(Stack st)\r\n{\r\n\tif (isEmpty(st))\r\n\t\treturn Integer.MIN_VALUE;\r\n\t\t\r\n\treturn st.array[st.top--];\r\n}\r\n\r\n\/\/ This function carries out the movement of the disk between two poles.\r\nvoid move(Stack src, Stack dest,\r\n\t\t\t\t\t\t\tchar s, char d)\r\n{\r\n\tint disk1 = pop(src);\r\n\tint disk2 = pop(dest);\r\n\r\n\t\/\/ Is rod 1 is empty\r\n\tif (disk1 == Integer.MIN_VALUE)\r\n\t{\r\n\t\tpush(src, disk2);\r\n\t\tprintMove(d, s, disk2);\r\n\t}\r\n\t\r\n\t\/\/ if rod 2  is empty\r\n\telse if (disk2 == Integer.MIN_VALUE)\r\n\t{\r\n\t\tpush(dest, disk1);\r\n\t\tprintMove(s, d, disk1);\r\n\t}\r\n\t\r\n\t\/\/ If Disk 1 &gt; Disk 2\r\n\telse if (disk1 &gt; disk2)\r\n\t{\r\n\t\tpush(src, disk1);\r\n\t\tpush(src, disk2);\r\n\t\tprintMove(d, s, disk2);\r\n\t}\r\n\t\/\/ If Disk 1 &lt; Disk 2\r\n\telse\r\n\t{\r\n\t\tpush(dest, disk2);\r\n\t\tpush(dest, disk1);\r\n\t\tprintMove(s, d, disk1);\r\n\t}\r\n}\r\n\r\n\/\/ This function will print the movement of disks\r\nvoid printMove(char from, char to, int disk)\r\n{\r\n\tSystem.out.println(&quot;Move the disk &quot; + disk +\r\n\t\t\t\t\t\t\t&quot; from &quot; + from +\r\n\t\t\t\t\t\t\t&quot; to &quot; + to);\r\n}\r\n\r\n\/\/ Function to implement the algorithm\r\nvoid iterativeTowerOfHanoi(int n, Stack\r\n\t\t\t\tsrc, Stack aux, Stack dest)\r\n{\r\n\tint i, moves;\r\n\tchar s = 'S', d = 'D', a = 'A';\r\n\r\n    \/\/ If n is even then exchange the position of destination rod and auxiliary rod.\r\n\tif (n % 2 == 0)\r\n\t{\r\n\t\tchar temp = d;\r\n\t\td = a;\r\n\t\ta = temp;\r\n\t}\r\n\tmoves = (int)(Math.pow(\r\n\t\t\t\t\t\t2, n) - 1);\r\n\r\n\tfor(i = n; i &gt;= 1; i--)\r\n\t\tpush(src, i);\r\n\r\n\tfor(i = 1; i &lt;= moves; i++)\r\n\t{\r\n\t\tif (i % 3 == 1)\r\n\t\tmove(src, dest, s, d);\r\n\r\n\t\telse if (i % 3 == 2)\r\n\t\tmove(src, aux, s, a);\r\n\r\n\t\telse if (i % 3 == 0)\r\n\t\tmove(aux, dest, a, d);\r\n\t}\r\n}\r\n\r\n    \/\/ Main function\r\n    public static void main(String[] args)\r\n    {\r\n\t\r\n\tint n = 3;\r\n\t\r\n\tTowerOfHanoi ob = new TowerOfHanoi();\r\n\r\n\t\/\/ Create three stacks (Source, destination, Auxiliary)\r\n\tStack source = ob.initStack(n);\r\n\tStack destination = ob.initStack(n);\r\n      Stack auxiliary = ob.initStack(n);\r\n\t\r\n\tob.iterativeTowerOfHanoi(n, source, auxiliary, destination);\r\n    }\r\n}\r\n\r\n<\/pre>\r\n<!-- \/wp:enlighter\/codeblock -->\r\n\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_9959 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_9959 a\"),jQuery(\"#tab-content_9959\"));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>Output<\/strong>:<br \/>\nMove the disk 1 from S to D<br \/>\nMove the disk 2 from S to A<br \/>\nMove the disk 1 from D to A<br \/>\nMove the disk 3 from S to D<br \/>\nMove the disk 1 from A to S<br \/>\nMove the disk 2 from A to D<br \/>\nMove the disk 1 from S to D<\/p>\n<p><strong>Time complexity<\/strong>: O(2n). The minimum number of moves required is 2n.<br \/>\n<strong>Space Complexity<\/strong>: O(n). We have to store at most n disks.<\/p>\n<p>We tried to discuss the Program for the Tower of Hanoi. We hope this article gives you a better understanding of the Program for Tower of Hanoi. <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> that 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 In the Tower of Hanoi problem you are given three rods (\u201cSource\u201d, \u201cDestination\u201d, \u201cAuxiliary\u201d) and n disks. Initially, all the disks are stacked on the source rod in decreasing order of the disk\u2019s size making a conical shape. Your task is to move all the stacked disks to the destination rod by obeying [&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":[1],"tags":[],"class_list":["post-9977","post","type-post","status-publish","format-standard","hentry","category-miscellaneous"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v25.8 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Program for Tower of Hanoi | PrepBytes Blog<\/title>\n<meta name=\"description\" content=\"We tried to discuss the Program for the Tower of Hanoi. We hope this article gives you a better understanding of the Program for Tower of Hanoi.\" \/>\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\/program-for-tower-of-hanoi\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Program for Tower of Hanoi | PrepBytes Blog\" \/>\n<meta property=\"og:description\" content=\"We tried to discuss the Program for the Tower of Hanoi. We hope this article gives you a better understanding of the Program for Tower of Hanoi.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/\" \/>\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-26T11:54:39+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-10-10T09:17:40+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-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=\"3 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/\"},\"author\":{\"name\":\"Prepbytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\"},\"headline\":\"Program for Tower of Hanoi\",\"datePublished\":\"2022-09-26T11:54:39+00:00\",\"dateModified\":\"2022-10-10T09:17:40+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/\"},\"wordCount\":554,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg\",\"articleSection\":[\"Miscellaneous\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/\",\"name\":\"Program for Tower of Hanoi | PrepBytes Blog\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg\",\"datePublished\":\"2022-09-26T11:54:39+00:00\",\"dateModified\":\"2022-10-10T09:17:40+00:00\",\"description\":\"We tried to discuss the Program for the Tower of Hanoi. We hope this article gives you a better understanding of the Program for Tower of Hanoi.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Miscellaneous\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/miscellaneous\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Program for Tower of Hanoi\"}]},{\"@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":"Program for Tower of Hanoi | PrepBytes Blog","description":"We tried to discuss the Program for the Tower of Hanoi. We hope this article gives you a better understanding of the Program for Tower of Hanoi.","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\/program-for-tower-of-hanoi\/","og_locale":"en_US","og_type":"article","og_title":"Program for Tower of Hanoi | PrepBytes Blog","og_description":"We tried to discuss the Program for the Tower of Hanoi. We hope this article gives you a better understanding of the Program for Tower of Hanoi.","og_url":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2022-09-26T11:54:39+00:00","article_modified_time":"2022-10-10T09:17:40+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg","type":"","width":"","height":""}],"author":"Prepbytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Prepbytes","Est. reading time":"3 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/"},"author":{"name":"Prepbytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e"},"headline":"Program for Tower of Hanoi","datePublished":"2022-09-26T11:54:39+00:00","dateModified":"2022-10-10T09:17:40+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/"},"wordCount":554,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg","articleSection":["Miscellaneous"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/","url":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/","name":"Program for Tower of Hanoi | PrepBytes Blog","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg","datePublished":"2022-09-26T11:54:39+00:00","dateModified":"2022-10-10T09:17:40+00:00","description":"We tried to discuss the Program for the Tower of Hanoi. We hope this article gives you a better understanding of the Program for Tower of Hanoi.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1664158332832-Topic.jpg"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/program-for-tower-of-hanoi\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Miscellaneous","item":"https:\/\/prepbytes.com\/blog\/category\/miscellaneous\/"},{"@type":"ListItem","position":3,"name":"Program for Tower of Hanoi"}]},{"@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\/9977","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=9977"}],"version-history":[{"count":3,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/9977\/revisions"}],"predecessor-version":[{"id":10178,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/9977\/revisions\/10178"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=9977"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=9977"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=9977"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}