gdata.io.handleScriptLoaded({"version":"1.0","encoding":"UTF-8","feed":{"xmlns":"http://www.w3.org/2005/Atom","xmlns$openSearch":"http://a9.com/-/spec/opensearchrss/1.0/","xmlns$gd":"http://schemas.google.com/g/2005","xmlns$georss":"http://www.georss.org/georss","xmlns$thr":"http://purl.org/syndication/thread/1.0","xmlns$blogger":"http://schemas.google.com/blogger/2008","id":{"$t":"tag:blogger.com,1999:blog-5735018943946871385"},"updated":{"$t":"2023-12-09T13:35:10.032-08:00"},"category":[{"term":"Hackerrank Delete duplicate-value nodes from a sorted linked list Solution"},{"term":"Hackerrank Print the elements of a linked list solution"},{"term":"PATTERNS"},{"term":"pattern generation in c"},{"term":"c++ program"},{"term":"Hackerrank Reverse a doubly linked list solution"},{"term":"programming"},{"term":"TEXT ANALYZER"},{"term":"networks"},{"term":"triangle pattern c++"},{"term":"unipolar encoding simulation"},{"term":"Hackerrank Print in Reverse solution"},{"term":"c++"},{"term":"education"},{"term":"opps sandclock pattern"},{"term":"opps triangle pattern"},{"term":"Linked Lists in C++"},{"term":"coding"},{"term":"C++ Diamond Pattern"},{"term":"hourglass pattern c++"},{"term":"hackerrank"},{"term":"java"},{"term":"c"},{"term":"Utopian tree"},{"term":"lexical analyser"},{"term":"cpp"},{"term":"Hackerrank Insert a node into a sorted doubly linked list Solution"},{"term":"java program"},{"term":"mini project"},{"term":"c programming"},{"term":"operator precedence"}],"title":{"type":"text","$t":"GRK"},"subtitle":{"type":"html","$t":"A blog by Gokul Raj Kumar"},"link":[{"rel":"http://schemas.google.com/g/2005#feed","type":"application/atom+xml","href":"https://www.blogger.com/feeds/5735018943946871385/posts/default/-/Hackerrank+Print+in+Reverse+solution?alt\u003djson-in-script\u0026max-results\u003d6"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/5735018943946871385/posts/default/-/Hackerrank+Print+in+Reverse+solution?alt\u003djson-in-script\u0026max-results\u003d6"},{"rel":"alternate","type":"text/html","href":"http://blog.grkweb.com/search/label/Hackerrank%20Print%20in%20Reverse%20solution"},{"rel":"hub","href":"http://pubsubhubbub.appspot.com/"}],"author":[{"name":{"$t":"GRK"},"uri":{"$t":"https://www.blogger.com/profile/00099219911209322075"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"generator":{"version":"7.00","uri":"https://www.blogger.com","$t":"Blogger"},"openSearch$totalResults":{"$t":"1"},"openSearch$startIndex":{"$t":"1"},"openSearch$itemsPerPage":{"$t":"6"},"entry":[{"id":{"$t":"tag:blogger.com,1999:blog-5735018943946871385.post-2617565913326339638"},"published":{"$t":"2015-04-18T08:12:00.010-07:00"},"updated":{"$t":"2022-01-16T20:52:21.295-08:00"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"cpp"},{"scheme":"http://www.blogger.com/atom/ns#","term":"c++"},{"scheme":"http://www.blogger.com/atom/ns#","term":"Linked Lists in C++"},{"scheme":"http://www.blogger.com/atom/ns#","term":"Hackerrank Print in Reverse solution"},{"scheme":"http://www.blogger.com/atom/ns#","term":"c++ program"},{"scheme":"http://www.blogger.com/atom/ns#","term":"hackerrank"}],"title":{"type":"text","$t":"Print a linked list in Reverse solution"},"content":{"type":"html","$t":"\u003cdiv dir\u003d\"ltr\" style\u003d\"text-align: left;\" trbidi\u003d\"on\"\u003e\n\u003ch2 style\u003d\"text-align: left;\"\u003e\nProblem Statement\u003c/h2\u003eYou're given the pointer to the head node of a linked list and you need to print all its elements in reverse order from tail to head, one element per line. The head pointer may be null meaning that the list is empty - in that case, don't print anything!\u003cbr /\u003e\n\u003ch2 style\u003d\"text-align: left;\"\u003e\nSoruce code:\u003c/h2\u003e\n\u003cpre style\u003d\"background-image: URL(http://2.bp.blogspot.com/_z5ltvMQPaa8/SjJXr_U2YBI/AAAAAAAAAAM/46OqEP32CJ8/s320/codebg.gif); background: rgb(240, 240, 240); border: 1px dashed rgb(204, 204, 204); color: black; font-family: arial; font-size: 12px; height: auto; line-height: 20px; overflow: auto; padding: 0px; text-align: left; width: 99%;\"\u003e\u003ccode style\u003d\"color: black; overflow-wrap: normal; word-wrap: normal;\"\u003e /*  \n  Print elements of a linked list in reverse order as standard output  \n  head pointer could be NULL as well for empty list  \n  Node is defined as   \n  struct Node  \n  {  \n    int data;  \n    struct Node *next;  \n  }  \n */  \n void ReversePrint(Node *head)  \n {  \n  // This is a \"method-only\" submission.   \n  // You only need to complete this method.   \n   int a[100],i\u003d0;  \n   while(head!\u003dNULL){  \n     a[i] \u003d head-\u0026gt;data;  \n     i++;  \n     head \u003d head-\u0026gt;next;  \n   }  \n   for(int j \u003d i-1;j\u0026gt;\u003d0;j--){  \n     cout\u0026lt;\u0026lt;a[j]\u0026lt;\u0026lt;endl;  \n   }  \n }  \n\u003c/code\u003e\u003c/pre\u003e\u003cbr /\u003e\u003c/div\u003e\n"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https://blog.grkweb.com/feeds/2617565913326339638/comments/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https://blog.grkweb.com/2015/04/hackerrank-print-in-reverse-solution.html#comment-form","title":"7 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https://www.blogger.com/feeds/5735018943946871385/posts/default/2617565913326339638"},{"rel":"self","type":"application/atom+xml","href":"https://www.blogger.com/feeds/5735018943946871385/posts/default/2617565913326339638"},{"rel":"alternate","type":"text/html","href":"https://blog.grkweb.com/2015/04/hackerrank-print-in-reverse-solution.html","title":"Print a linked list in Reverse solution"}],"author":[{"name":{"$t":"GRK"},"uri":{"$t":"https://www.blogger.com/profile/00099219911209322075"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"35","height":"35","src":"//www.blogger.com/img/blogger_logo_round_35.png"}}],"thr$total":{"$t":"7"}}]}});