{"id":6620,"date":"2022-06-28T23:10:00","date_gmt":"2022-06-28T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=6620"},"modified":"2022-06-20T15:12:36","modified_gmt":"2022-06-20T09:42:36","slug":"organizing-containers-of-balls-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/organizing-containers-of-balls-hackerrank-solution\/","title":{"rendered":"Organizing Containers of Balls &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Organizing Containers of Balls HackerRank Solution<\/strong>. This problem <strong>(Organizing Containers of Balls)<\/strong> is a part of <strong>HackerRank Ruby<\/strong> series.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_66_1 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-6648cd34c0012\" 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-6648cd34c0012\" 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\/organizing-containers-of-balls-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\/organizing-containers-of-balls-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\/organizing-containers-of-balls-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\/organizing-containers-of-balls-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\/organizing-containers-of-balls-hackerrank-solution\/#Solution_%E2%80%93_Organizing_Containers_of_Balls_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Organizing Containers of Balls &#8211; HackerRank Solution\">Solution &#8211; Organizing Containers of Balls &#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\/organizing-containers-of-balls-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\/organizing-containers-of-balls-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\/organizing-containers-of-balls-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>David has several containers, each with a number of balls in it. He has just enough containers to sort each type of ball he has into its own container. David wants to sort the balls using his sort method.<\/p>\n\n\n\n<p>David wants to perform some number of swap operations such that:<\/p>\n\n\n\n<ul><li>Each container contains only balls of the same type.<\/li><li>No two balls of the same type are located in different containers.<\/li><\/ul>\n\n\n\n<p><strong>Example<\/strong><br><strong><em>containers<\/em> = [[1, 4], [2, 3]]<\/strong><\/p>\n\n\n\n<p>David has\u00a0<strong><em>n<\/em> = 2<\/strong>\u00a0containers and\u00a0<strong>2<\/strong>\u00a0different types of balls, both of which are numbered from\u00a0<strong>0<\/strong>\u00a0to\u00a0<strong><em>n<\/em> &#8211; 1 = 1<\/strong>. <\/p>\n\n\n\n<p>In a single operation, David can\u00a0<em>swap<\/em>\u00a0two balls located in different containers.<\/p>\n\n\n\n<p>In this case, there is no way to have all green balls in one container and all red in the other using only swap operations. Return&nbsp;<code>Impossible<\/code>.<\/p>\n\n\n\n<p>You must perform\u00a0<em><strong>q<\/strong><\/em>\u00a0queries where each query is in the form of a matrix,\u00a0<em><strong>M<\/strong><\/em>. For each query, print\u00a0<code>Possible<\/code>\u00a0on a new line if David can satisfy the conditions above for the given matrix. Otherwise, print\u00a0<code>Impossible<\/code>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>organizingContainers<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>organizingContainers has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>int containter[n][m]<\/em>: a two dimensional array of integers that represent the number of balls of each color in each container<\/li><\/ul>\n\n\n\n<p><strong>Returns<\/strong><\/p>\n\n\n\n<ul><li><em>string:<\/em>&nbsp;either&nbsp;<code>Possible<\/code>&nbsp;or&nbsp;<code>Impossible<\/code><\/li><\/ul>\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 an integer\u00a0<em><strong>q<\/strong><\/em>, the number of queries.<\/p>\n\n\n\n<p>Each of the next\u00a0<em><strong>q<\/strong><\/em>\u00a0sets of lines is as follows:<\/p>\n\n\n\n<ol><li>The first line contains an integer\u00a0<em><strong>n<\/strong><\/em>, the number of containers (rows) and ball types (columns).<\/li><li>Each of the next\u00a0<em><strong>n<\/strong><\/em>\u00a0lines contains\u00a0<em><strong>n<\/strong><\/em>\u00a0space-separated integers describing row\u00a0<strong><em>containers<\/em>[i]<\/strong>.<\/li><\/ol>\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>q<\/em> &lt;= 10<\/strong><\/li><li><strong>1 &lt;= <em>n<\/em> &lt;= 100<\/strong><\/li><li><strong>0 &lt;= <em>containers<\/em>[<em>i<\/em>][<em>j<\/em>] &lt;= 10<sup>9<\/sup><\/strong><\/li><\/ul>\n\n\n\n<p><strong>Scoring<\/strong><\/p>\n\n\n\n<ul><li>For\u00a0<strong>33%<\/strong>\u00a0of score,\u00a0<strong>1 &lt;= <em>n<\/em> &lt;= 10<\/strong>.<\/li><li>For\u00a0<strong>100%<\/strong>\u00a0of score,\u00a0<strong>1 &lt;= <em>n<\/em> &lt;= 100<\/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 query, print\u00a0<code>Possible<\/code>\u00a0on a new line if David can satisfy the conditions above for the given matrix. Otherwise, print\u00a0<code>Impossible<\/code>.<\/p>\n\n\n\n<p><strong>Sample Input 0<\/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>2\r\n2\r\n1 1\r\n1 1\r\n2\r\n0 2\r\n1 1<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 0<\/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>Possible\r\nImpossible<\/code><\/pre>\n\n\n\n<p><strong>Sample Input 1<\/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>2\r\n3\r\n1 3 1\r\n2 1 2\r\n3 3 3\r\n3\r\n0 2 1\r\n1 1 1\r\n2 0 0<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 1<\/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>Impossible\r\nPossible<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Organizing_Containers_of_Balls_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Organizing Containers of Balls &#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;bits\/stdc++.h>\n\nusing namespace std;\n\n\/\/ Complete the organizingContainers function below.\nint main() \n{\n    int t;\n    cin>>t;\n    while(t--)\n    {\n        int n;\n        cin>>n;\n        vector&lt;vector&lt;int>> M(n);\n        for (int i = 0; i &lt; n; i++) \n        {\n            M[i].resize(n);\n\n            for (int j = 0; j &lt; n; j++)\n            {\n                cin >> M[i][j];\n            }\n        }\n        vector&lt;int> col(n,0),row(n,0);\n        for(int i=0;i&lt;n;i++)\n        {\n            for(int j=0;j&lt;n;j++)\n            {\n                col[i]+=M[i][j];\n                row[i]+=M[j][i];\n            }\n        }\n        sort(col.begin(),col.end());\n        sort(row.begin(),row.end());\n\n        if(col==row)\n            cout&lt;&lt;\"Possible\"&lt;&lt;endl;\n        else \n            cout&lt;&lt;\"Impossible\"&lt;&lt;endl;\n    }\n        return 0;\n    \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\n# Complete the organizingContainers function below.\ndef organizingContainers(container):\n    caps = []\n    for i in range(len(container)):\n        caps.append( sum(container[i]) )\n    #print(caps)\n\n    typenums = []\n    for i in range(len(container)):\n        n = 0\n        for j in range(len(container)):\n            n += container[j][i]\n        typenums.append(n)\n    \n    if sorted(caps) == sorted(typenums):\n        return 'Possible'\n    else:\n        return 'Impossible'\n\nif __name__ == '__main__':\n    fptr = open(os.environ['OUTPUT_PATH'], 'w')\n\n    q = int(input())\n\n    for q_itr in range(q):\n        n = int(input())\n\n        container = []\n\n        for _ in range(n):\n            container.append(list(map(int, input().rstrip().split())))\n\n        result = organizingContainers(container)\n\n        fptr.write(result + '\\n')\n\n    fptr.close()\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.math.*;\nimport java.security.*;\nimport java.text.*;\nimport java.util.*;\nimport java.util.concurrent.*;\nimport java.util.regex.*;\n\npublic class Solution {\n\n    \/\/ Complete the organizingContainers function below.\n    static String organizingContainers(int[][] container,int n) {\n    int type[]=new int[n];\n        int capa[]=new int[n];\n        for(int i=0;i&lt;n;i++)\n        {\n            for(int j=0;j&lt;n;j++)\n            {\n                type[j]+=container[i][j];\n                capa[i]+=container[i][j];\n            }\n        }\n        Arrays.sort(type);\n        Arrays.sort(capa);\n        for(int i=0;i&lt;type.length;i++)\n        {\n            if(type[i]!=capa[i])\n                return \"Impossible\";\n        }\n        return \"Possible\";\n    }\n\n    private static final Scanner scanner = new Scanner(System.in);\n\n    public static void main(String[] args) throws IOException {\n        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv(\"OUTPUT_PATH\")));\n\n        int q = scanner.nextInt();\n        scanner.skip(\"(\\r\\n|[\\n\\r\\u2028\\u2029\\u0085])?\");\n\n        for (int qItr = 0; qItr &lt; q; qItr++) {\n            int n = scanner.nextInt();\n            scanner.skip(\"(\\r\\n|[\\n\\r\\u2028\\u2029\\u0085])?\");\n\n            int[][] container = new int[n][n];\n\n            for (int i = 0; i &lt; n; i++) {\n                String[] containerRowItems = scanner.nextLine().split(\" \");\n                scanner.skip(\"(\\r\\n|[\\n\\r\\u2028\\u2029\\u0085])?\");\n\n                for (int j = 0; j &lt; n; j++) {\n                    int containerItem = Integer.parseInt(containerRowItems[j]);\n                    container[i][j] = containerItem;\n                }\n            }\n\n            String result = organizingContainers(container,n);\n\n            bufferedWriter.write(result);\n            bufferedWriter.newLine();\n        }\n\n        bufferedWriter.close();\n\n        scanner.close();\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/organizing-containers-of-balls\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Organizing Containers of Balls<\/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 Organizing Containers of Balls HackerRank Solution. This problem (Organizing Containers of Balls) is a part of HackerRank Ruby 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\/6620"}],"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=6620"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6620\/revisions"}],"predecessor-version":[{"id":6622,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/6620\/revisions\/6622"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=6620"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=6620"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=6620"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}