{"id":3178,"date":"2021-06-11T20:51:43","date_gmt":"2021-06-11T15:21:43","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=3178"},"modified":"2021-06-11T20:51:48","modified_gmt":"2021-06-11T15:21:48","slug":"mini-max-sum-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/mini-max-sum-solution\/","title":{"rendered":"Mini-Max Sum | HackerRank Solution"},"content":{"rendered":"\n<p>Hello coders, today we are going to solve<strong> Mini-Max Sum HackerRank Solution<\/strong> which is a Part of <strong>Problem Solving<\/strong> Series.<\/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\/06\/mini-max-algorithm-solution-codingbroz.png\" alt=\"Mini-Max Sum\" class=\"wp-image-3180\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/mini-max-algorithm-solution-codingbroz.png 1200w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/mini-max-algorithm-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-662d4fcce8b31\" 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-662d4fcce8b31\" 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\/mini-max-sum-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\/mini-max-sum-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\/mini-max-sum-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\/mini-max-sum-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\/mini-max-sum-solution\/#Solution_%E2%80%93_Mini-Max_Sum\" title=\"Solution &#8211; Mini-Max Sum \">Solution &#8211; Mini-Max Sum <\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/mini-max-sum-solution\/#C\" title=\"C++\">C++<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/mini-max-sum-solution\/#Python\" title=\"Python\">Python<\/a><\/li><\/ul><\/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>Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong><em>arr<\/em> = [1, 3, 5, 7, 9]<\/strong><br>The minimum sum is\u00a0<strong>1 + 3 +5 +7 = 16<\/strong>\u00a0and the maximum sum is<strong>\u00a03 + 5 + 7 + 9 = 24<\/strong>. The function prints<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>16 24<\/code><\/pre>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>miniMaxSum<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>miniMaxSum has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>arr<\/em>: an array of\u00a0<strong>5<\/strong>\u00a0integers<\/li><\/ul>\n\n\n\n<p><strong>Print<\/strong><\/p>\n\n\n\n<p>Print two space-separated integers on one line: the minimum sum and the maximum sum of\u00a0<strong>4<\/strong>\u00a0of\u00a0<strong>5<\/strong>\u00a0elements.<\/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>A single line of five space-separated integers.<\/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>arr[i<\/em>] &lt;= 10<sup>9<\/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>Print two space-separated long integers denoting the respective minimum and maximum values that can be calculated by summing exactly\u00a0<em>four<\/em>\u00a0of the five integers. (The output can be greater than a 32 bit integer.)<\/p>\n\n\n\n<p><strong>Sample Input<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>1 2 3 4 5<\/code><\/pre>\n\n\n\n<p><strong>Sample Output<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>10 14<\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p>The numbers are\u00a0<strong>1<\/strong>,\u00a0<strong>2<\/strong>,\u00a0<strong>3<\/strong>,\u00a0<strong>4<\/strong>, and\u00a0<strong>5<\/strong>. Calculate the following sums using four of the five integers:<\/p>\n\n\n\n<ol><li>Sum everything except\u00a0<strong>1<\/strong>, the sum is<strong>\u00a02 + 3 + 4 + 5 = 14<\/strong>.<\/li><li>Sum everything except\u00a0<strong>2<\/strong>, the sum is\u00a0<strong>1 + 3 + 4 + 5 = 13<\/strong>.<\/li><li>Sum everything except\u00a0<strong>3<\/strong>, the sum is\u00a0<strong>1 + 2 + 4 + 5 = 12<\/strong>.<\/li><li>Sum everything except\u00a0<strong>4<\/strong>, the sum is<strong>\u00a01 + 2 + 3 + 5 = 11<\/strong>.<\/li><li>Sum everything except\u00a0<strong>5<\/strong>, the sum is\u00a0<strong>1 + 2 +3 + 4 = 10<\/strong>.<\/li><\/ol>\n\n\n\n<p><strong>Hints:<\/strong>\u00a0Beware of integer overflow! Use 64-bit Integer.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Mini-Max_Sum\"><\/span><strong>Solution &#8211; Mini-Max Sum <\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C\"><\/span><strong>C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\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=\"\">#include &lt;bits\/stdc++.h>\n\nusing namespace std;\n\nstring ltrim(const string &amp;);\nstring rtrim(const string &amp;);\nvector&lt;string> split(const string &amp;);\n\n\/*\n * Complete the 'miniMaxSum' function below.\n *\n * The function accepts INTEGER_ARRAY arr as parameter.\n *\/\n\nvoid miniMaxSum(vector&lt;int> arr) {\n    long long min = LLONG_MAX , max = LLONG_MIN , sum ;\n    for(int i = 0 ;i &lt; arr.size() ; ++i)\n    {\n        sum = 0;\n        for(int j = 0; j &lt; arr.size() ; ++j)\n        {\n            if(i != j)\n                sum += arr[j];\n        }\n\n        if(sum > max)\n            max = sum;\n\n        if (sum &lt; min)\n            min = sum;\n    }\n\n    cout &lt;&lt; min &lt;&lt; \" \" &lt;&lt; max &lt;&lt; endl;\n}\n\nint main()\n{\n\n    string arr_temp_temp;\n    getline(cin, arr_temp_temp);\n\n    vector&lt;string> arr_temp = split(rtrim(arr_temp_temp));\n\n    vector&lt;int> arr(5);\n\n    for (int i = 0; i &lt; 5; i++) {\n        int arr_item = stoi(arr_temp[i]);\n\n        arr[i] = arr_item;\n    }\n\n    miniMaxSum(arr);\n\n    return 0;\n}\n\nstring ltrim(const string &amp;str) {\n    string s(str);\n\n    s.erase(\n        s.begin(),\n        find_if(s.begin(), s.end(), not1(ptr_fun&lt;int, int>(isspace)))\n    );\n\n    return s;\n}\n\nstring rtrim(const string &amp;str) {\n    string s(str);\n\n    s.erase(\n        find_if(s.rbegin(), s.rend(), not1(ptr_fun&lt;int, int>(isspace))).base(),\n        s.end()\n    );\n\n    return s;\n}\n\nvector&lt;string> split(const string &amp;str) {\n    vector&lt;string> tokens;\n\n    string::size_type start = 0;\n    string::size_type end = 0;\n\n    while ((end = str.find(\" \", start)) != string::npos) {\n        tokens.push_back(str.substr(start, end - start));\n\n        start = end + 1;\n    }\n\n    tokens.push_back(str.substr(start));\n\n    return tokens;\n}\n<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Python\"><\/span><strong>Python<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\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=\"\">#!\/bin\/python3\n\nimport math\nimport os\nimport random\nimport re\nimport sys\n\ndef miniMaxSum(arr):\n    # Write your code here\n    arr = sorted(arr)\n    print(sum(arr[:-1]),sum(arr[1:]))\n\nif __name__ == '__main__':\n\n    arr = list(map(int, input().rstrip().split()))\n\n    miniMaxSum(arr)\n<\/pre>\n\n\n\n<p><strong>Disclaimer: <\/strong>The above Problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/mini-max-sum\/problem\" target=\"_blank\" rel=\"noreferrer noopener\">Mini-Max Sum<\/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 Mini-Max Sum HackerRank Solution which is a Part of Problem Solving Series.<\/p>\n","protected":false},"author":1,"featured_media":3180,"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,190],"tags":[191,81,108,18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/mini-max-algorithm-solution-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/3178"}],"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=3178"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/3178\/revisions"}],"predecessor-version":[{"id":3181,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/3178\/revisions\/3181"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/3180"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=3178"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=3178"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=3178"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}