{"id":7331,"date":"2022-08-11T23:05:00","date_gmt":"2022-08-11T17:35:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7331"},"modified":"2022-08-06T18:10:45","modified_gmt":"2022-08-06T12:40:45","slug":"order-exercises-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/order-exercises-hackerrank-solution\/","title":{"rendered":"Order exercises &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Order exercises HackerRank Solution<\/strong>. This problem <strong>(Order exercises)<\/strong> is a part of <strong>HackerRank Functional Programming<\/strong> series.<\/p>\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-662cd49799a2b\" 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-662cd49799a2b\" 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\/order-exercises-hackerrank-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\/order-exercises-hackerrank-solution\/#Input\" title=\"Input\">Input<\/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\/order-exercises-hackerrank-solution\/#Output\" title=\"Output\">Output<\/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\/order-exercises-hackerrank-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-5\" href=\"https:\/\/www.codingbroz.com\/order-exercises-hackerrank-solution\/#Solution_%E2%80%93_Order_exercises_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Order exercises &#8211; HackerRank Solution\">Solution &#8211; Order exercises &#8211; HackerRank Solution<\/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>During a math class, a teacher wanted to practice ordering with students. He gave an array of\u00a0<em><strong>N<\/strong><\/em>\u00a0integers,\u00a0<strong><em>a<\/em> = {<em>a<\/em><sub>1<\/sub>, <em>a<\/em><sub>2<\/sub>, . . . ,<em>a<\/em><sub>N<\/sub>}<\/strong>\u00a0to the students along with following definitions:<\/p>\n\n\n\n<ul><li>Subarray is a contiguous segment of array. For example\u00a0<strong><em>a<\/em>[<em>l<\/em>, <em>r<\/em>] = {<em>a<\/em><sub>l<\/sub>, <em>a<\/em><sub>l+1<\/sub>, . . . , <em>a<\/em><sub>r<\/sub>}<\/strong>\u00a0is a subarray, where\u00a0<\/li><li>We say that a sum of a subarray <strong><em>X<\/em>(=<em>a<\/em>[<em>xl<\/em>, <em>xr<\/em>] = {<em>a<\/em><sub><em>xl<\/em><\/sub>, <em>a<\/em><sub><em>xl<\/em>+1<\/sub>, . . . , <em>a<\/em><sub><em>xr<\/em><\/sub>})<\/strong> is a sum of elements in this subarray<\/li><li>We say that subarray\u00a0\u00a0is greater than subarray\u00a0\u00a0if and only if:<ul><li><em><strong>X<\/strong><\/em>\u00a0has a greater sum than\u00a0<em><strong>Y<\/strong><\/em><\/li><li><em><strong>X<\/strong><\/em>\u00a0and\u00a0<em><strong>Y<\/strong><\/em>\u00a0has the same sum and\u00a0<em><strong>X<\/strong><\/em>\u00a0begins earlier<\/li><li><em><strong>X<\/strong><\/em>\u00a0and\u00a0<em><strong>Y<\/strong><\/em>\u00a0has the same sum, they start in the same place and the length of\u00a0<em><strong>X<\/strong><\/em>\u00a0is smaller than the length of\u00a0<em><strong>Y<\/strong><\/em><\/li><\/ul><\/li><\/ul>\n\n\n\n<p>Since the teacher doesn&#8217;t like number 0, there is no 0 in the array\u00a0<em><strong>a<\/strong><\/em>. Other than array\u00a0<em><strong>a<\/strong><\/em>, the teacher also gave an integer\u00a0<em><strong>K<\/strong><\/em>. The task is to lists as many as possible, but not more than\u00a0<em><strong>K<\/strong><\/em>, subarrays with a\u00a0<em>positive sum<\/em>\u00a0in the following order.<\/p>\n\n\n\n<ul><li>The first subarray is the greatest subarray in the array according to above definition.<\/li><li>The\u00a0<strong><em>i<sup>th<\/sup><\/em><\/strong>\u00a0subarray is the greatest subarray disjoint to any of the\u00a0<strong><em>j<sup>th<\/sup><\/em><\/strong>\u00a0subarray, where\u00a0<strong><em>j<\/em> &lt; <em>i<\/em><\/strong>\u00a0(disjoint means that they have no common elements).<\/li><\/ul>\n\n\n\n<p>Of course in order to win with others, you have to solve the problem first.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Input\"><\/span><strong>Input<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>In the first line there are two integers\u00a0<em><strong>N<\/strong><\/em>\u00a0and\u00a0<em><strong>K<\/strong><\/em>\u00a0separated by a single space.<br>In the second line there are\u00a0<em><strong>N<\/strong><\/em>\u00a0integers separated by single space denoting the array\u00a0<em><strong>arr<\/strong><\/em>.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Output\"><\/span><strong>Output<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Print no more than\u00a0<em><strong>K<\/strong><\/em>\u00a0lines. In the\u00a0<strong><em>i<sup>th<\/sup><\/em><\/strong>\u00a0line print the sum of the\u00a0<strong><em>i<sup>th<\/sup><\/em><\/strong>\u00a0sequence in the above 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>N<\/em> &lt;= 10<sup>5<\/sup><\/strong><\/li><li><strong>1 &lt;= <em>K<\/em> &lt;= <em>N<\/em><\/strong><\/li><li><strong>0 &lt; |<em>a<sub>i<\/sub><\/em>| &lt;= 104, where <em>i<\/em> \u2208 [1, <em>N<\/em>]<\/strong><\/li><\/ul>\n\n\n\n<p><strong>Sample Input 00<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>5 3\r\n2 4 -10 2 -2<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 00<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>6\r\n2<\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p>Subarray\u00a0<strong><em>a<\/em>[1, 2] = {<em>a<\/em>1, <em>a<\/em>2}<\/strong>\u00a0has sum 6 and this is the greatest value in the whole array. Next disjoint greatest subarray is\u00a0<strong><em>a<\/em>[4, 4] = <em>a<\/em><sub>4<\/sub><\/strong>\u00a0with sum = 2. There are no more subsequences with a positive value disjoint with the first and the second subsequence.<\/p>\n\n\n\n<p><strong>Sample Input 01<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>4 2\r\n-2 5 -1 -8<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 01<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code has-ast-global-color-5-color has-ast-global-color-8-background-color has-text-color has-background\"><code>5  <\/code><\/pre>\n\n\n\n<p><strong>Explanation 01<\/strong><\/p>\n\n\n\n<p>Subarray\u00a0<strong><em>a<\/em>[2, 2] = {<em>a<\/em>2}<\/strong>\u00a0has sum 5 and this is the greatest value in the whole array. There are no more subsequences with a positive value disjoint with the first one, so even if K = 2, we print out just one value.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Order_exercises_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Order exercises &#8211; HackerRank Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p><strong>Scala<\/strong><\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"scala\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">import java.util.Scanner\n\nimport scala.collection.immutable.Queue\n\nobject Solution {\n  def main(args: Array[String]): Unit = {\n    val sc = new Scanner(System.in)\n\n    sc.nextInt\n    val k = sc.nextInt\n    sc.nextLine\n    val a = sc.nextLine.split(\" \").map(_.toInt)\n\n    sc.close()\n\n    case class Acc(list: List[Int])\n    val sentinel = Int.MaxValue \/ 2\n    val temp = a.foldLeft(Acc(List(-sentinel, sentinel)))((acc, v) => acc.list match {\n      case Nil if v &lt; 0 => acc\n      case Nil => Acc(v :: Nil)\n      case list@x :: xs => if ((v &lt; 0) == (x &lt; 0)) Acc(x + v :: xs) else Acc(v :: list)\n    }).list\n\n    val compressed = if (temp.head &lt; 0) temp.tail else temp\n\n    println(solve(compressed)\n      .sortBy(-_)\n      .take(k)\n      .mkString(\"\\n\")\n    )\n  }\n\n  def solve(seq: List[Int]): List[Int] = {\n    case class Accumulator(totalSum: Int, queue: Queue[Int], answer: List[Int])\n\n    @scala.annotation.tailrec\n    def inner(seq: List[Int], acc: Accumulator): List[Int] = {\n      seq match {\n        case Nil =>\n          acc.answer\n        case xPos :: xs if acc.queue.isEmpty =>\n          \/\/empty queue\n          inner(xs, Accumulator(xPos, Queue(xPos), acc.answer))\n        case xNeg :: xPos :: xs =>\n          val (nextSeq, nextAcc) = {\n            val sNeg = acc.totalSum + xNeg\n            if (sNeg &lt;= 0) {\n              val (firstPos, tempQueue) = acc.queue.dequeue\n\n              if (tempQueue.isEmpty) {\n                \/\/All items in queue are processed.\n                (xs, Accumulator(xPos, Queue(xPos), firstPos :: acc.answer))\n              } else {\n                if (acc.totalSum >= firstPos) {\n                  \/\/Glue items in queue.\n                  (xs, Accumulator(xPos, Queue(xPos), acc.totalSum :: acc.answer))\n                } else {\n                  \/\/Separate first item in queue.\n                  val (_, nextQueue) = tempQueue.dequeue\n                  (nextQueue.toList ++ seq, Accumulator(0, Queue(), firstPos :: acc.answer))\n                }\n              }\n            } else {\n              val sPos = sNeg + xPos\n              if (sPos >= acc.queue.head) {\n                \/\/Glue\n                (xs, Accumulator(sPos, Queue(sPos), acc.answer))\n              } else {\n                \/\/Uncertain\n                (xs, Accumulator(sPos, acc.queue.enqueue(xNeg).enqueue(xPos), acc.answer))\n              }\n            }\n          }\n\n          inner(nextSeq, nextAcc)\n      }\n    }\n\n    inner(seq, Accumulator(0, Queue(), Nil))\n  }\n}<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/order-exercises\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Order exercises<\/a>)<\/strong> is generated by <strong><a href=\"https:\/\/www.hackerrank.com\/\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">HackerRank<\/a><\/strong> but the solution is provided by <strong><a href=\"https:\/\/www.codingbroz.com\/\">CodingBroz<\/a><\/strong>. This tutorial is only <strong>Educational<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will solve Order exercises HackerRank Solution. This problem (Order exercises) is a part of HackerRank Functional Programming series.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","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":"","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,684],"tags":[692],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7331"}],"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\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=7331"}],"version-history":[{"count":4,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7331\/revisions"}],"predecessor-version":[{"id":7336,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7331\/revisions\/7336"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7331"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7331"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7331"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}