{"id":2684,"date":"2021-06-05T18:25:29","date_gmt":"2021-06-05T12:55:29","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=2684"},"modified":"2021-06-22T15:39:49","modified_gmt":"2021-06-22T10:09:49","slug":"java-1darray-2-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/java-1darray-2-solution\/","title":{"rendered":"Java 1D Array (Part 2) | HackerRank Solution"},"content":{"rendered":"\n<p>Hello coders, today we are going to solve <strong>Java 1D Array (Part 2) HackerRank Solution<\/strong>.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1167\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/java-array1d-2.png\" alt=\"Java 1D Array (Part 2)\" class=\"wp-image-2685\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/java-array1d-2.png 1167w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/java-array1d-2-768x444.png 768w\" sizes=\"(max-width: 1167px) 100vw, 1167px\" \/><\/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-663538a2306f7\" 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-663538a2306f7\" 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\/java-1darray-2-solution\/#Problem\" title=\"Problem\">Problem<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/java-1darray-2-solution\/#Function_Description\" title=\"Function Description\">Function Description<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/java-1darray-2-solution\/#Returns\" title=\"Returns\">Returns<\/a><\/li><\/ul><\/li><\/ul><\/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\/java-1darray-2-solution\/#Input_format\" title=\"Input format\">Input format<\/a><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><ul class='ez-toc-list-level-4' ><li class='ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/java-1darray-2-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/java-1darray-2-solution\/#Sample_Input\" title=\"Sample Input\">Sample Input<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/java-1darray-2-solution\/#Sample_Output\" title=\"Sample Output\">Sample Output<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-4'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/java-1darray-2-solution\/#Explanation\" title=\"Explanation\">Explanation<\/a><\/li><\/ul><\/li><\/ul><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-9\" href=\"https:\/\/www.codingbroz.com\/java-1darray-2-solution\/#Solution_%E2%80%93_Java_1D_Array_Part_2\" title=\"Solution &#8211; Java 1D Array (Part 2)\">Solution &#8211; Java 1D Array (Part 2)<\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Problem\"><\/span><strong>Problem<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Let&#8217;s play a game on an array! You&#8217;re standing at index <strong>0 <\/strong>of an <strong>n<\/strong>-element array named <strong>game<\/strong>. From some index <strong>i<\/strong>(where <strong>0 &lt;= i &lt; n<\/strong>), you can perform one of the following moves:<\/p>\n\n\n\n<ul><li>Move Backward: If cell <strong>i-1 <\/strong>exists and contains a <strong>0<\/strong>, you can walk back to cell <strong>i-1<\/strong>.<\/li><li>Move Forward:<ul><li>If cell <strong>i+1 <\/strong>contains a zero, you can walk to cell <strong>i+1<\/strong>.<\/li><li>If cell <strong>i + leap <\/strong>contains a zero, you can jump to cell <strong>i + leap<\/strong>.<\/li><li>If you&#8217;re standing in cell <strong>n-1 <\/strong>or the value of <strong>i + leap &gt;= n<\/strong>, you can walk or jump off the end of the array and win the game.<\/li><\/ul><\/li><\/ul>\n\n\n\n<p>In other words, you can move from index <strong>i <\/strong>to index <strong>i + 1<\/strong>, <strong>i &#8211; 1<\/strong>, or <strong>i + leap <\/strong>as long as the destination index is a cell containing a <strong>0<\/strong>. If the destination index is greater than <strong>n-1<\/strong>, you win the game.<\/p>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Function_Description\"><\/span><strong>Function Description<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<p>Complete the canWin function in the editor below.<br>canWin has the following parameters:<\/p>\n\n\n\n<ul><li>int leap: the size of the leap<\/li><li>int game[n]: the array to traverse<\/li><\/ul>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Returns\"><\/span><strong>Returns<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<p>boolean: true if the game can be won, otherwise false<\/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 an integer, <strong>q<\/strong>, denoting the number of queries (i.e., function calls).<br>The <strong>2 . q <\/strong>subsequent lines describe each query over two lines:<\/p>\n\n\n\n<ol><li>The first line contains two space-separated integers describing the respective values of <strong>n <\/strong>and <strong>leap<\/strong>.<\/li><li>The second line contains <strong>n <\/strong>space-separated binary integers (i.e., zeroes and ones) describing the respective values of <strong>game<sub>0<\/sub> , game<sub>1<\/sub>, game<sub>2<\/sub>, &#8230;.. , game<sub>n-1<\/sub><\/strong>.<\/li><\/ol>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<ul><li><strong>1 &lt;= q &lt;= 5000<\/strong><\/li><li><strong>2 &lt;= n &lt;= 100<\/strong><\/li><li><strong>0 &lt;= leap &lt;= 100<\/strong><\/li><li>It is guaranteed that the value of <em><strong>game[0]<\/strong> <\/em>is always<strong><em> 0<\/em><\/strong>.<\/li><\/ul>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Sample_Input\"><\/span><strong>Sample Input<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<pre class=\"wp-block-code\"><code> STDIN           Function\n -----           --------\n 4               q = 4 (number of queries)\n 5 3             game&#91;] size n = 5, leap = 3 (first query)\n 0 0 0 0 0       game = &#91;0, 0, 0, 0, 0]\n 6 5             game&#91;] size n = 6, leap = 5 (second query)\n 0 0 0 1 1 1     . . .\n 6 3\n 0 0 1 1 1 0\n 3 1\n 0 1 0<\/code><\/pre>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Sample_Output\"><\/span><strong>Sample Output<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<pre class=\"wp-block-code\"><code> YES\n YES\n NO\n NO<\/code><\/pre>\n\n\n\n<h4 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Explanation\"><\/span><strong>Explanation<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h4>\n\n\n\n<p>We perform the following <strong>q = 4 <\/strong>queries:<\/p>\n\n\n\n<ol><li>For <strong><em>game = [0, 0, 0, 0, 0]<\/em><\/strong> and <strong><em>leap = 3<\/em><\/strong>, we can walk and\/or jump to the end of the array because every cell contains a <strong>0<\/strong>. Because we can win, we return true.<\/li><li>For <strong><em>game = [0, 0, 0, 1, 1, 1]<\/em><\/strong> and <strong><em>leap = <\/em>5<\/strong>, we can walk to the index <strong>1 <\/strong>and then jump <strong><em>i + leap = 1 + 5 = 6 <\/em><\/strong>units to the end of the array. Because we can win, we return true.<\/li><li>For <strong><em>game = [0, 0, 1, 1, 1, 0]<\/em><\/strong> and <strong><em>leap = 3<\/em><\/strong>, there is no way for us to get past the three consecutive ones. Because we cannot win, we return false.<\/li><li>For <strong><em>game = [0, 1, 0]<\/em><\/strong> and <strong><em>leap = <\/em>1<\/strong>, there is no way for us to get past the one at index <strong>1<\/strong>. Because we cannot win, we return false.<\/li><\/ol>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Java_1D_Array_Part_2\"><\/span><strong>Solution &#8211;<\/strong> <strong>Java <strong>1D Array (Part 2)<\/strong><\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\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.util.*;\n\npublic class Solution {\n\n    public static boolean find_path(int leap, int[] game, int x) {\n        if (x &lt; 0) {\n            return false;\n        }\n\n        if (x > game.length - 1) {\n            return true;\n        }\n\n        if (game[x] != 0) {\n            return false;\n        }\n\n        game[x] = 5;\n\n        if (find_path(leap, game, x + 1)) {\n            return true;\n        }\n        if (find_path(leap, game, x + leap)) {\n            return true;\n        }\n        if (find_path(leap, game, x - 1)) {\n            return true;\n        }\n\n        game[x] = 0;\n\n        return false;\n    }\n\n    public static boolean canWin(int leap, int[] game) {\n        return find_path(leap, game, 0);\n    }\n\n\n    public static void main(String[] args) {\n        Scanner scan = new Scanner(System.in);\n        int q = scan.nextInt();\n        while (q-- > 0) {\n            int n = scan.nextInt();\n            int leap = scan.nextInt();\n            \n            int[] game = new int[n];\n            for (int i = 0; i &lt; n; i++) {\n                game[i] = scan.nextInt();\n            }\n\n            System.out.println( (canWin(leap, game)) ? \"YES\" : \"NO\" );\n        }\n        scan.close();\n    }\n}<\/pre>\n\n\n\n<script async src=\"https:\/\/pagead2.googlesyndication.com\/pagead\/js\/adsbygoogle.js\"><\/script>\n<ins class=\"adsbygoogle\"\n     style=\"display:block; text-align:center;\"\n     data-ad-layout=\"in-article\"\n     data-ad-format=\"fluid\"\n     data-ad-client=\"ca-pub-5246141430412355\"\n     data-ad-slot=\"8798433565\"><\/ins>\n<script>\n     (adsbygoogle = window.adsbygoogle || []).push({});\n<\/script>\n\n\n\n<p><strong>Disclaimer:<\/strong> The above Problem ( <em><a href=\"https:\/\/www.hackerrank.com\/challenges\/java-1d-array\/problem\" target=\"_blank\" data-type=\"URL\" data-id=\"https:\/\/www.hackerrank.com\/challenges\/java-1d-array\/problem\" rel=\"noreferrer noopener\"><strong>Java<\/strong> <strong>1D Array (Part 2)<\/strong> <\/a><\/em>) 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 Java 1D Array (Part 2) HackerRank Solution.<\/p>\n","protected":false},"author":1,"featured_media":2685,"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,120],"tags":[80,84,18,121],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/java-array1d-2.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2684"}],"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=2684"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2684\/revisions"}],"predecessor-version":[{"id":3741,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/2684\/revisions\/3741"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/2685"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=2684"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=2684"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=2684"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}