{"id":7353,"date":"2022-08-12T23:10:00","date_gmt":"2022-08-12T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7353"},"modified":"2022-08-07T15:38:50","modified_gmt":"2022-08-07T10:08:50","slug":"cavity-map-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/cavity-map-hackerrank-solution\/","title":{"rendered":"Cavity Map &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Cavity Map HackerRank Solution<\/strong>. This problem <strong>(Cavity Map)<\/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_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-66484a383a7aa\" 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-66484a383a7aa\" 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\/cavity-map-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\/cavity-map-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\/cavity-map-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\/cavity-map-hackerrank-solution\/#Solution_%E2%80%93_Cavity_Map_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Cavity Map &#8211; HackerRank Solution\">Solution &#8211; Cavity Map &#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-5\" href=\"https:\/\/www.codingbroz.com\/cavity-map-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-6\" href=\"https:\/\/www.codingbroz.com\/cavity-map-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-7\" href=\"https:\/\/www.codingbroz.com\/cavity-map-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>You are given a square map as a matrix of integer strings. Each cell of the map has a value denoting its depth. We will call a cell of the map a&nbsp;<em>cavity<\/em>&nbsp;if and only if this cell is not on the border of the map and each cell adjacent to it has&nbsp;<em>strictly smaller depth<\/em>. Two cells are adjacent if they have a common side, or&nbsp;<em>edge<\/em>.<\/p>\n\n\n\n<p>Find all the cavities on the map and replace their depths with the uppercase character&nbsp;<strong>X<\/strong>.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong><em>grid<\/em> = [&#8216;989&#8217;, &#8216;191&#8217;, &#8216;111&#8217;]<\/strong><\/p>\n\n\n\n<p>The grid is rearranged for clarity:<\/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>989\r\n191\r\n111<\/code><\/pre>\n\n\n\n<p>Return:<\/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>989\r\n1X1\r\n111<\/code><\/pre>\n\n\n\n<p>The center cell was deeper than those on its edges:&nbsp;<em>[8,1,1,1]<\/em>. The deep cells in the top two corners do not share an edge with the center cell, and none of the border cells is eligible.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>cavityMap<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>cavityMap has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>string grid[n]:<\/em>&nbsp;each string represents a row of the grid<\/li><\/ul>\n\n\n\n<p><strong>Returns<\/strong><\/p>\n\n\n\n<ul><li><em>string{n}:<\/em>\u00a0the modified grid<\/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>n<\/strong><\/em>, the number of rows and columns in the grid.<\/p>\n\n\n\n<p>Each of the following\u00a0<em><strong>n<\/strong><\/em>\u00a0lines (<em>rows<\/em>) contains\u00a0<em><strong>n<\/strong><\/em>\u00a0positive digits without spaces (<em>columns<\/em>) that represent the depth at\u00a0<strong><em>grid<\/em>[<em>row<\/em>, <em>column<\/em>]<\/strong>.<\/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;= 100<\/strong><\/li><\/ul>\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>STDIN   Function\r\n-----   --------\r\n4       grid&#91;] size n = 4\r\n1112    grid = &#91;'1112', '1912', '1892', '1234']\r\n1912\r\n1892\r\n1234<\/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>1112\r\n1X12\r\n18X2\r\n1234<\/code><\/pre>\n\n\n\n<p><strong>Explanation<\/strong><\/p>\n\n\n\n<p>The two cells with the depth of 9 are not on the border and are surrounded on all sides by shallower cells. Their values are replaced by X.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Cavity_Map_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Cavity Map &#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>\nusing namespace std;\n\n\nint main(){\n    int n;\n    cin >> n;\n    vector&lt;string> grid(n);\n    for(int grid_i = 0;grid_i &lt; n;grid_i++){\n       cin >> grid[grid_i];\n    }\n    char **answer = new char*[n];\n    for(int i = 0; i &lt; n; i++) {\n        answer[i] = new char[n];\n        for(int j = 0; j &lt; n; j++) {\n            answer[i][j] = grid[i][j];\n        }\n    }\n    for(int i = 1; i &lt; n-1; i++) {\n        for(int j = 1; j &lt; n-1; j++) {\n            if(grid[i][j] > grid[i-1][j] &amp;&amp; grid[i][j] > grid[i][j-1] &amp;&amp; grid[i][j] > grid[i][j+1] &amp;&amp; grid[i][j] > grid[i+1][j]) {\n                answer[i][j] = 'X';\n            }\n        }\n    }\n    for(int i = 0; i &lt; n; i++) {\n        for(int j = 0; j &lt; n; j++) {\n            cout&lt;&lt;answer[i][j];\n        }\n        cout&lt;&lt;\"\\n\";\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=\"\">import sys\n\ndef cavityMap(grid):\n    leng = len(grid)\n    output = [[0]*leng for _ in range(leng)]\n    \n    for ind in range(leng):\n        for jnd in range(leng):\n            if (0 &lt; ind &lt; leng-1 and 0 &lt; jnd &lt; leng-1 and\n               grid[ind][jnd] > grid[ind+1][jnd] and\n               grid[ind][jnd] > grid[ind-1][jnd] and\n               grid[ind][jnd] > grid[ind][jnd+1] and\n               grid[ind][jnd] > grid[ind][jnd-1]):\n                output[ind][jnd] = 'X'\n            else:\n                output[ind][jnd] = grid[ind][jnd]\n    \n    return output\n\nif __name__ == \"__main__\":\n    n = int(input().strip())\n    grid = []\n    grid_i = 0\n    for grid_i in range(n):\n        grid_t = list(map(int, input().strip()))\n        grid.append(grid_t)\n    result = cavityMap(grid)\n    print(\"\\n\".join([\"\".join(map(str, x)) for x in result]))\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        \/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. *\/\n        Scanner in = new Scanner(System.in);\n        int n = Integer.parseInt(in.nextLine());\n        int[][] array = new int[n][n];\n        int[][] target = new int[n][n];\n        for(int i=0; i&lt;n; i++){\n            String line = in.nextLine();\n            char[] data = line.toCharArray();\n            for(int j=0; j&lt;n; j++){\n                array[i][j] = Character.getNumericValue(data[j]);\n                \/\/System.out.println(array[i][j]);\n            }\n        }\n        cavityMap(array, target);\n        for(int i=0; i&lt;n; i++){\n            for(int j=0; j&lt;n; j++){\n                if(target[i][j] == -1)\n                    System.out.print(\"X\");\n                else\n                    System.out.print(array[i][j]);\n            }\n            System.out.println(\"\");\n        }\n    }\n    \n    public static void cavityMap(int[][] array, int[][] target) {\n        int row = array.length;\n        int col = array[0].length;\n        for(int i=1; i&lt;row-1; i++){\n            for(int j=1; j&lt;col-1; j++){\n                if(isMaximum(array, i, j)){\n                    target[i][j] = -1; \/\/ will be translate to X later\n                }\n            }\n        }\n    }\n    \n    public static boolean isMaximum(int[][] array, int i, int j) {\n        int max = Math.max(Math.max(array[i-1][j], array[i+1][j]), Math.max(array[i][j-1], array[i][j+1]));\n        if(max >= array[i][j])\n            return false;\n        else\n            return true;\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/cavity-map\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Cavity Map<\/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 Cavity Map HackerRank Solution. This problem (Cavity Map) 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\/7353"}],"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=7353"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7353\/revisions"}],"predecessor-version":[{"id":7355,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7353\/revisions\/7355"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7353"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7353"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7353"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}