{"id":7318,"date":"2022-08-10T23:10:00","date_gmt":"2022-08-10T17:40:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=7318"},"modified":"2022-08-05T15:48:12","modified_gmt":"2022-08-05T10:18:12","slug":"flatland-space-stations-hackerrank-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/flatland-space-stations-hackerrank-solution\/","title":{"rendered":"Flatland Space Stations &#8211; HackerRank Solution"},"content":{"rendered":"\n<p>In this post, we will solve <strong>Flatland Space Stations HackerRank Solution<\/strong>. This problem <strong>(Flatland Space Stations)<\/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-662d525049e57\" 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-662d525049e57\" 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\/flatland-space-stations-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\/flatland-space-stations-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\/flatland-space-stations-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\/flatland-space-stations-hackerrank-solution\/#Solution_%E2%80%93_Flatland_Space_Stations_%E2%80%93_HackerRank_Solution\" title=\"Solution &#8211; Flatland Space Stations &#8211; HackerRank Solution\">Solution &#8211; Flatland Space Stations &#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\/flatland-space-stations-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\/flatland-space-stations-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\/flatland-space-stations-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>Flatland is a country with a number of cities, some of which have space stations. Cities are numbered consecutively and each has a road of\u00a0<strong>1<em>km<\/em><\/strong>\u00a0length connecting it to the next city. It is not a circular route, so the first city doesn&#8217;t connect with the last city. Determine the maximum distance from any city to its nearest space station.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong><em>n<\/em> = 3<\/strong><br><strong><em>c<\/em> = [1]<\/strong><\/p>\n\n\n\n<p>There are\u00a0<strong><em>n<\/em> = 3<\/strong>\u00a0cities and city\u00a0<strong>1<\/strong>\u00a0has a space station. They occur consecutively along a route. City\u00a0<strong>0<\/strong>\u00a0is\u00a0<strong>1 &#8211; 0 = 1<\/strong>\u00a0unit away and city\u00a0<strong>2<\/strong>\u00a0is\u00a0<strong>2 &#8211; 1 = 1<\/strong>\u00a0units away. City\u00a0<strong>1<\/strong>\u00a0is\u00a0<strong>0<\/strong>\u00a0units from its nearest space station as one is located there. The maximum distance is\u00a0<strong>1<\/strong>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>flatlandSpaceStations<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>flatlandSpaceStations has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>int n:<\/em>&nbsp;the number of cities<\/li><li><em>int c[m]:<\/em>&nbsp;the indices of cities with a space station<\/li><\/ul>\n\n\n\n<p><strong>Returns<\/strong><br>&#8211;\u00a0<em>int:<\/em>\u00a0the maximum distance any city is from a space station<\/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 consists of two space-separated integers,\u00a0<em><strong>n<\/strong><\/em>\u00a0and\u00a0<em><strong>m<\/strong><\/em>.<br>The second line contains\u00a0<em><strong>m<\/strong><\/em>\u00a0space-separated integers, the indices of each city that has a space-station. These values are\u00a0<em>unordered<\/em>\u00a0and distinct.<\/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>m<\/em> &lt;= <em>n<\/em> <\/strong><\/li><li>There will be at least\u00a0<strong>1<\/strong>\u00a0city with a space station.<\/li><li>No city has more than one space station.<\/li><\/ul>\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>STDIN   Function\r\n-----   --------\r\n5 2     n = 5, c&#91;] size m = 2\r\n0 4     c = &#91;0, 4]<\/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>2<\/code><\/pre>\n\n\n\n<p><strong>Explanation 0<\/strong><\/p>\n\n\n\n<p>This sample corresponds to following graphic:<\/p>\n\n\n\n<p>The distance to the nearest space station for each city is listed below:<\/p>\n\n\n\n<ul><li><strong><em>c<\/em>[0]<\/strong>\u00a0has distance\u00a0<strong>0 <em>km<\/em><\/strong>, as it contains a space station.<\/li><li><strong><em>c<\/em>[1]<\/strong>\u00a0has distance\u00a0<strong>1 <em>km<\/em><\/strong>\u00a0to the space station in\u00a0<strong><em>c<\/em>[0]<\/strong>.<\/li><li><strong><em>c<\/em>[2]<\/strong>\u00a0has distance\u00a0<strong>2 <em>km<\/em><\/strong>\u00a0to the space stations in\u00a0<strong><em>c<\/em>[0]<\/strong>\u00a0and\u00a0<strong><em>c<\/em>[4]<\/strong>.<\/li><li><strong><em>c<\/em>[3]<\/strong>\u00a0has distance\u00a0<strong>1 <em>km<\/em><\/strong>\u00a0to the space station in\u00a0<strong><em>c<\/em>[4]<\/strong>.<\/li><li><strong><em>c<\/em>[4]<\/strong>\u00a0has distance\u00a0<strong>0 <em>km<\/em><\/strong>, as it contains a space station.<\/li><\/ul>\n\n\n\n<p>We then take\u00a0<strong><em>max<\/em>(0, 1, 2, 1, 0) = 2<\/strong>.<\/p>\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>6 6\r\n0 1 2 4 3 5<\/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>0<\/code><\/pre>\n\n\n\n<p><strong>Explanation 1<\/strong><\/p>\n\n\n\n<p>In this sample,\u00a0<strong><em>n<\/em> = <em>m<\/em><\/strong>\u00a0so every city has space station and we print\u00a0<strong>0<\/strong>\u00a0as our answer.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Flatland_Space_Stations_%E2%80%93_HackerRank_Solution\"><\/span><strong>Solution &#8211; Flatland Space Stations &#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    \/* Enter your code here. Read input from STDIN. Print output to STDOUT *\/\n    int n , m , maxi = 0;\n    cin>> n >> m;\n    vector&lt;int> station(m);\n    for(int i=0 ; i&lt;m ; i++) cin >> station[i];\n    sort(station.begin(), station.end());\n    for(int i=0 ; i&lt;=station[0] ; i++) maxi = max(maxi, station[0]-i);\n    for(int i=0 ; i&lt;m-1 ; i++){\n        for(int j = station[i] ; j&lt;=station[i+1] ; j++) {\n            maxi = max(maxi, min(j-station[i], station[i+1]-j));\n        }\n    }\n    for(int i=station[m-1] ; i&lt;n ; i++) maxi = max(maxi, i-station[m-1]);\n    cout &lt;&lt; maxi &lt;&lt; endl;\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 flatlandSpaceStations(n, stations):\n    stations = sorted(stations)\n    res = stations[0]\n    \n    for ind in range(1, len(stations)):\n        res = max(res, (stations[ind] - stations[ind-1])\/\/2)\n        \n    res = max(res, n-1 - stations[-1])\n        \n    return res\n        \n    \n\nif __name__ == \"__main__\":\n    n, m = input().strip().split(' ')\n    n, m = [int(n), int(m)]\n    c = list(map(int, input().strip().split(' ')))\n    result = flatlandSpaceStations(n, c)\n    print(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        Scanner in = new Scanner(System.in);\n        int N = in.nextInt();\n        int M = in.nextInt();\n        int[] list = new int[M];\n        for(int i = 0; i &lt; M; i++) {\n            list[i] = in.nextInt();\n        }\n        Arrays.sort(list);\n        \n        int first = Math.abs(0 - list[0]);\n        int last = Math.abs((N - 1) - list[M-1]);\n        int max = Math.max(first, last);\n        int maxSpace = 0;\n        for(int i = 0; i &lt; M - 1; i++) {\n            maxSpace = Math.max(Math.abs(list[i] - list[i+1]), maxSpace);\n        }\n        max = Math.max(max, maxSpace \/ 2);\n        System.out.println(max);\n    }\n}\n<\/pre>\n\n\n\n<p><strong>Note:<\/strong> This problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/flatland-space-stations\/problem\" target=\"_blank\" rel=\"noreferrer noopener nofollow\">Flatland Space Stations<\/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 Flatland Space Stations HackerRank Solution. This problem (Flatland Space Stations) 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\/7318"}],"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=7318"}],"version-history":[{"count":5,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7318\/revisions"}],"predecessor-version":[{"id":7324,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/7318\/revisions\/7324"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=7318"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=7318"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=7318"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}