{"id":7844,"date":"2022-09-15T23:10:00","date_gmt":"2022-09-15T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7844"},"modified":"2022-09-10T13:42:36","modified_gmt":"2022-09-10T08:12:36","slug":"the-full-counting-sort-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/the-full-counting-sort-hackerrank-solution\/","title":{"rendered":"The Full Counting Sort &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>The Full Counting Sort HackerRank Solution<\/strong>. This problem <strong>(The Full Counting Sort)<\/strong> is a part of <strong>HackerRank Problem Solving<\/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-6635df50c798b\" 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-6635df50c798b\" 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\/the-full-counting-sort-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\/the-full-counting-sort-hackerrank-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\/the-full-counting-sort-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-4\" href=\"https:\/\/www.codingbroz.com\/the-full-counting-sort-hackerrank-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\/the-full-counting-sort-hackerrank-solution\/#Solution_%E2%80%93_The_Full_Counting_Sort_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; The Full Counting Sort &#8211; HackerRank Solution\">Solution &#8211; The Full Counting Sort &#8211; HackerRank Solution<\/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\/the-full-counting-sort-hackerrank-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\/the-full-counting-sort-hackerrank-solution\/#Python\" title=\"Python\">Python<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/the-full-counting-sort-hackerrank-solution\/#Java\" title=\"Java\">Java<\/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>Use the counting sort to order a list of strings associated with integers. If two strings are associated with the same integer, they must be printed in their original order, i.e. your sorting algorithm should be&nbsp;<em>stable<\/em>. There is one other twist: strings in the first half of the array are to be replaced with the character&nbsp;<code>-<\/code>&nbsp;(dash, ascii 45 decimal).<\/p>\n\n\n\n<p>Insertion Sort and the simple version of Quicksort are stable, but the faster in-place version of Quicksort is not since it scrambles around elements while sorting.<\/p>\n\n\n\n<p>Design your counting sort to be stable.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong><em>arr<\/em> = [[0, &#8216;a&#8217;], [1, &#8216;b&#8217;], [0, &#8216;c&#8217;], [1, &#8216;d&#8217;]]<\/strong><\/p>\n\n\n\n<p>The first two strings are replaced with &#8216;-&#8216;. Since the maximum associated integer is\u00a0<strong>1<\/strong>, set up a helper array with at least two empty arrays as elements. The following shows the insertions into an array of three empty arrays.<\/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>i\tstring\tconverted\tlist\r\n0\t\t\t\t&#91;&#91;],&#91;],&#91;]]\r\n1 \ta \t-\t\t&#91;&#91;-],&#91;],&#91;]]\r\n2\tb\t-\t\t&#91;&#91;-],&#91;-],&#91;]]\r\n3\tc\t\t\t&#91;&#91;-,c],&#91;-],&#91;]]\r\n4\td\t\t\t&#91;&#91;-,c],&#91;-,d],&#91;]]<\/code><\/pre>\n\n\n\n<p>The result is then printed:\u00a0<strong>-c -d<\/strong>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>countSort<\/em>&nbsp;function in the editor below. It should construct and print the sorted strings.<\/p>\n\n\n\n<p>countSort has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>string arr[n][2]:<\/em>&nbsp;each&nbsp;<em>arr[i]<\/em>&nbsp;is comprised of two strings,&nbsp;<em>x<\/em>&nbsp;and&nbsp;<em>s<\/em><\/li><\/ul>\n\n\n\n<p><strong>Returns<\/strong><br>&#8211; Print the finished array with each element separated by a single space.<\/p>\n\n\n\n<p><strong>Note<\/strong>: The first element of each\u00a0<strong><em>arr<\/em>[<em>i<\/em>]<\/strong>,\u00a0<em><strong>x<\/strong><\/em>, must be cast as an integer to perform the sort.<\/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\u00a0<em><strong>n<\/strong><\/em>, the number of integer\/string pairs in the array\u00a0<em><strong>arr<\/strong><\/em>.<br>Each of the next\u00a0<em><strong>n<\/strong><\/em>\u00a0contains\u00a0<strong><em>x<\/em>[<em>i<\/em>]<\/strong>\u00a0and\u00a0<strong><em>s<\/em>[<em>i<\/em>]<\/strong>, the integers (as strings) with their associated strings.<\/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;= 1000000<\/strong><\/li><li><em><strong>n<\/strong><\/em> is even<\/li><li><strong>1 &lt;= |<em>s<\/em>| &lt;= 10<\/strong><\/li><li><strong>0 &lt;= <em>x<\/em> &lt; 100, <em>x<\/em> \u2208 <em>ar<\/em><\/strong><\/li><li><strong><em>s<\/em>[<em>i<\/em>]<\/strong> consists of characters in the range\u00a0<strong>ascii[a &#8211; z]<\/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 the strings in their correct order, space-separated on one line.<\/p>\n\n\n\n<p><strong>Sample Input<\/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>20\r\n0 ab\r\n6 cd\r\n0 ef\r\n6 gh\r\n4 ij\r\n0 ab\r\n6 cd\r\n0 ef\r\n6 gh\r\n0 ij\r\n4 that\r\n3 be\r\n0 to\r\n1 be\r\n5 question\r\n1 or\r\n2 not\r\n4 is\r\n2 to\r\n4 the<\/code><\/pre>\n\n\n\n<p><strong>Sample Output <\/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>- - - - - to be or not to be - that is the question - - - -<\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p>The correct order is shown below. In the array at the bottom, strings from the first half of the original array were replaced with dashes.<\/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>0 ab\r\n0 ef\r\n0 ab\r\n0 ef\r\n0 ij\r\n0 to\r\n1 be\r\n1 or\r\n2 not\r\n2 to\r\n3 be\r\n4 ij\r\n4 that\r\n4 is\r\n4 the\r\n5 question\r\n6 cd\r\n6 gh\r\n6 cd\r\n6 gh<\/code><\/pre>\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>sorted = &#91;&#91;'-', '-', '-', '-', '-', 'to'], &#91;'be', 'or'], &#91;'not', 'to'], &#91;'be'], &#91;'-', 'that', 'is', 'the'], &#91;'question'], &#91;'-', '-', '-', '-'], &#91;], &#91;], &#91;], &#91;]]<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_The_Full_Counting_Sort_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; The Full Counting Sort &#8211; HackerRank Solution<\/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;cmath>\n#include &lt;cstdio>\n#include &lt;vector>\n#include &lt;iostream>\n#include &lt;algorithm>\n#include &lt;string.h>\nusing namespace std;\n\n\/\/ Stable counting sort\n\/\/ Total runtime: O(n + k), where is n is the number of elements to sort and k is the size of the largest key\nint main() {\n    int count[100], n, tmp;\n    cin>>n;\n    int *key = new int[n]; \/\/ Holds the keys for each string\n    memset(count, 0, sizeof(count)); \/\/ Count will tell us the starting index for each key\n    string s, *input = new string[n], *output = new string[n];\n    \n    \/\/ Read input, while calculating key frequencies\n    for(int i = 0; i &lt; n; i++) {\n        cin>>tmp;\n        count[tmp]++; \/\/ Count the number of times each key appears\n        cin>>s;\n        \/\/ Store string in an array, following the rules of the problem (the \"twist\")\n        if(i &lt; n\/2) {\n            input[i] = '-';\n        } else {\n            input[i]= s;\n        }\n        key[i] = tmp; \/\/ Store the key in an array\n    }\n\n    \/\/ Calculate the starting index for each key (we did this in the previous challenge)\n    int total = 0;\n    for(int i = 0; i &lt; 100; i++) {\n        total += count[i];\n        count[i] = total;\n    }\n\n    \/\/ Copy to output array, preserving order of inputs with equal keys\n    for(int i = n-1; i >= 0; i--) {\n        output[count[key[i]]-1] = input[i];\n        count[key[i]]--;\n    }\n\n    \/\/ Print out final array\n    for(int i = 0; i &lt; n; i++) {\n        cout&lt;&lt;output[i]&lt;&lt;\" \";\n    }\n    return 0;\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 sys\n\nif __name__ == \"__main__\":\n    n = int(input().strip())\n    array = []\n    print_dict = {}\n    for a0 in range(n):\n        x, s = input().strip().split(' ')\n        x, s = [int(x), str(s)]\n        \n        if a0 &lt; n\/\/2:\n            array.append((x, \"-\"))\n        else:\n            array.append((x, s))\n            \n    print(\" \".join(map(lambda x: x[1], sorted(array, key = lambda x: x[0]))))\n<\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Java\"><\/span><strong>Java<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\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=\"\">import java.io.*;\nimport java.util.*;\n\npublic class Solution {\n\n    public static void main(String[] args) {\n        Scanner sc = new Scanner(System.in);\n        int n = sc.nextInt();\n        int[] numbers = new int[n];\n        int[] counter = new int[100];\n        String[] s = new String[n];\n        String[] orderedS = new String[n];\n        StringBuilder out = new StringBuilder();\n        for (int i = 0; i &lt; n; i++) {\n            numbers[i] = sc.nextInt();\n            counter[numbers[i]]++;\n            s[i] = sc.next();\n        }\n\n        for (int i = 1; i &lt; 100; i++) { counter[i] += counter[i-1]; }\n\n        for (int i = (n-1); i >= 0; i--) {\n            if (i &lt; n\/2) {\n                orderedS[counter[numbers[i]] - 1] = \"-\";\n            } else {\n                orderedS[counter[numbers[i]] - 1] = s[i];\n            }\n            counter[numbers[i]] -= 1;\n        }\n\n        for (int i = 0; i &lt; n; i++) {\n            out.append(orderedS[i] + \" \");\n        }\n\n        System.out.print(out);\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/countingsort4\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">The Full Counting Sort<\/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 for <strong>Educational<\/strong> and <strong>Learning<\/strong> purpose.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will solve The Full Counting Sort HackerRank Solution. This problem (The Full Counting Sort) is a part of HackerRank Problem Solving 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,190],"tags":[191],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7844"}],"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=7844"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7844\/revisions"}],"predecessor-version":[{"id":7848,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7844\/revisions\/7848"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7844"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7844"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7844"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}