{"id":2151,"date":"2021-05-30T11:39:36","date_gmt":"2021-05-30T06:09:36","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=2151"},"modified":"2021-06-21T18:16:47","modified_gmt":"2021-06-21T12:46:47","slug":"piling-up-python-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/piling-up-python-solution\/","title":{"rendered":"Piling Up! in Python | Hacker Rank Solution"},"content":{"rendered":"\n<p>Hello coders, today we are going to solve <strong>Piling Up! Hacker Rank Solution<\/strong> in <strong>Python<\/strong>.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1200\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/piling-up-in-python-solution-codingbroz.png\" alt=\"Piling Up! in Python\" class=\"wp-image-2153\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/piling-up-in-python-solution-codingbroz.png 1200w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/piling-up-in-python-solution-codingbroz-768x432.png 768w\" sizes=\"(max-width: 1200px) 100vw, 1200px\" \/><\/figure>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662e5491e5ada\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662e5491e5ada\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/piling-up-python-solution\/#Task\" title=\"Task\">Task<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/piling-up-python-solution\/#Input_Format\" title=\"Input Format \">Input Format <\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/piling-up-python-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/piling-up-python-solution\/#Output_Format\" title=\"Output Format\">Output Format<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/piling-up-python-solution\/#Solution_%E2%80%93_Piling_Up_in_Python\" title=\"Solution &#8211; Piling Up! in Python \">Solution &#8211; Piling Up! in Python <\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Task\"><\/span><strong>Task<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>There is a horizontal row of&nbsp;<strong><em>n<\/em><\/strong>&nbsp;cubes. The length of each cube is given. You need to create a new vertical pile of cubes. The new pile should follow these directions: if&nbsp;<strong><em>cube<\/em>[<em>i<\/em>]<\/strong>&nbsp;is on top of&nbsp;<strong><em>cube<\/em>[<em>j<\/em>]<\/strong>&nbsp;then&nbsp;<strong><em>sideLength<\/em>|<em>j<\/em>| =&gt; <em>sideLength<\/em>|<em>i<\/em>|<\/strong>.<\/p>\n\n\n\n<p>When stacking the cubes, you can only pick up either the leftmost or the rightmost cube each time. Print&nbsp;<code>Yes<\/code>&nbsp;if it is possible to stack the cubes. Otherwise, print&nbsp;<code>No<\/code>.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong>blocks = [1, 2, 3, 8, 7]<\/strong><\/p>\n\n\n\n<p>Result:&nbsp;<code>No<\/code><\/p>\n\n\n\n<p>After choosing the rightmost element,&nbsp;<strong>7<\/strong>, choose the leftmost element,&nbsp;<strong>1<\/strong>. After than, the choices are&nbsp;<strong>2<\/strong>&nbsp;and&nbsp;<strong>8<\/strong>. These are both larger than the top block of size&nbsp;<strong>1<\/strong>.<\/p>\n\n\n\n<p><strong><em>blocks <\/em>= [1, 2, 3, 7, 8]<\/strong><\/p>\n\n\n\n<p>Result:&nbsp;<code>Yes<\/code><\/p>\n\n\n\n<p>Choose blocks from right to left in order to successfully stack the blocks.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Input_Format\"><\/span><strong>Input Format <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>The first line contains a single integer&nbsp;<em><strong>T<\/strong><\/em>, the number of test cases.<br>For each test case, there are&nbsp;<strong>2<\/strong>&nbsp;lines.<br>The first line of each test case contains&nbsp;<strong><em>n<\/em><\/strong>, the number of cubes.<br>The second line contains&nbsp;<strong><em>n<\/em><\/strong>&nbsp;space separated integers, denoting the&nbsp;<em>sideLengths<\/em>&nbsp;of each cube in that order.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<ul><li><strong>1 &lt;= <em>T<\/em> &lt;= 5<\/strong><\/li><li><strong>1 &lt;= <em>n<\/em> &lt;= 10<sup>5<\/sup><\/strong><\/li><li><strong>1 &lt;= <\/strong><em><strong>sideLength <\/strong><\/em><strong>&lt; 2<sup>31<\/sup><\/strong><\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Output_Format\"><\/span><strong>Output Format<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>For each test case, output a single line containing either&nbsp;<code>Yes<\/code>&nbsp;or&nbsp;<code>No<\/code>.<\/p>\n\n\n\n<p><strong>Sample Input<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>STDIN        Function\n-----        --------\n2            T = 2\n6            blocks&#91;] size n = 6\n4 3 2 1 3 4  blocks = &#91;4, 3, 2, 1, 3, 4]\n3            blocks&#91;] size n = 3\n1 3 2        blocks = &#91;1, 3, 2]<\/code><\/pre>\n\n\n\n<p><strong>Sample Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Yes\nNo<\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p>In the first test case, pick in this order:&nbsp;<strong>left &#8211;&nbsp;4, right &#8211;&nbsp;4, left &#8211;&nbsp;3, right &#8211;&nbsp;3, left &#8211;&nbsp;2, right &#8211;&nbsp;1<\/strong>.<br>In the second test case, no order gives an appropriate arrangement of vertical cubes.&nbsp;<strong>3<\/strong>&nbsp;will always come after either&nbsp;<strong>1<\/strong>&nbsp;or&nbsp;<strong>2<\/strong>.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Piling_Up_in_Python\"><\/span><strong>Solution &#8211; Piling Up! in Python <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\"># Enter your code here. Read input from STDIN. Print output to STDOUT\nANS = []\nT = int(input())\n\nfor _ in range(T):\n    n = int(input())\n    sl = list(map(int, input().split()))\n\n    for _ in range(n-1):\n        if sl[0] >= sl[len(sl)-1]:\n            a = sl[0]\n            sl.pop(0)\n        elif sl[0] &lt; sl[len(sl)-1]:\n            a = sl[len(sl)-1]\n            sl.pop(len(sl)-1)\n        else:\n            pass\n\n        if len(sl) == 1:\n            ANS.append(\"Yes\")\n\n        if((sl[0] > a) or (sl[len(sl)-1] > a)):\n            ANS.append(\"No\")\n            break\n\nprint(\"\\n\".join(ANS))<\/pre>\n\n\n\n<script async src=\"https:\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script>\n<ins class=\"adsbygoogle\"\n     style=\"display:block; text-align:center;\"\n     data-ad-layout=\"in-article\"\n     data-ad-format=\"fluid\"\n     data-ad-client=\"ca-pub-5246141430412355\"\n     data-ad-slot=\"8798433565\"><\/ins>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script>\n\n\n\n<p><strong>Disclaimer:<\/strong> The above Problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/piling-up\/problem\" target=\"_blank\" rel=\"noreferrer noopener\" class=\"rank-math-link\">Piling Up!<\/a>)<\/strong> is generated by <strong>Hacker Rank<\/strong> but the Solution is Provided by <strong>CodingBroz<\/strong>. This tutorial is only for <strong>Educational<\/strong> and<strong> Learning<\/strong> Purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Hello coders, today we are going to solve Piling Up! Hacker Rank Solution in Python.<\/p>\n","protected":false},"author":1,"featured_media":2153,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[9,107],"tags":[18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/05\/piling-up-in-python-solution-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2151"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=2151"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2151\/revisions"}],"predecessor-version":[{"id":3645,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2151\/revisions\/3645"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/2153"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=2151"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=2151"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=2151"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}