{"id":3278,"date":"2021-06-16T09:02:58","date_gmt":"2021-06-16T03:32:58","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=3278"},"modified":"2021-06-16T09:03:03","modified_gmt":"2021-06-16T03:33:03","slug":"subarray-division-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/subarray-division-solution\/","title":{"rendered":"Subarray Division | HackerRank Solution"},"content":{"rendered":"\n<p>Hello coders, today we are going to solve <strong>Subarray Division HackerRank Solution<\/strong> which is a Part of<strong> HackerRank Algorithms<\/strong> Series.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1200\" height=\"675\" src=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/subarray-division-algorithm-solution-codingbroz.png\" alt=\"Subarray Division\" class=\"wp-image-3282\" srcset=\"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/subarray-division-algorithm-solution-codingbroz.png 1200w, https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/subarray-division-algorithm-solution-codingbroz-768x432.png 768w\" sizes=\"(max-width: 1200px) 100vw, 1200px\" \/><\/figure>\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-66490a7145827\" 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-66490a7145827\" 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\/subarray-division-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\/subarray-division-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\/subarray-division-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\/subarray-division-solution\/#Solution_%E2%80%93_Subarray_Division\" title=\"Solution &#8211; Subarray Division\">Solution &#8211; Subarray Division<\/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\/subarray-division-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\/subarray-division-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\/subarray-division-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>Two children, Lily and Ron, want to share a chocolate bar. Each of the squares has an integer on it.<\/p>\n\n\n\n<p>Lily decides to share a contiguous segment of the bar selected such that:<\/p>\n\n\n\n<ul><li>The length of the segment matches Ron&#8217;s birth month, and,<\/li><li>The sum of the integers on the squares is equal to his birth day.<\/li><\/ul>\n\n\n\n<p>Determine how many ways she can divide the chocolate.<\/p>\n\n\n\n<p><strong>Example<\/strong><\/p>\n\n\n\n<p><strong><em>s<\/em> = [2, 2, 1, 3, 2]<\/strong><br><strong><em>d<\/em> = 4<\/strong><br><strong><em>m<\/em> = 2<\/strong><br>Lily wants to find segments summing to Ron&#8217;s birth day,\u00a0<strong><em>d<\/em> = 4<\/strong>\u00a0with a length equalling his birth month,\u00a0<strong><em>m<\/em> = 2<\/strong>. In this case, there are two segments meeting her criteria:\u00a0<strong>[2, 2]<\/strong>\u00a0and\u00a0<strong>[1, 3]<\/strong>.<\/p>\n\n\n\n<p><strong>Function Description<\/strong><\/p>\n\n\n\n<p>Complete the&nbsp;<em>birthday<\/em>&nbsp;function in the editor below.<\/p>\n\n\n\n<p>birthday has the following parameter(s):<\/p>\n\n\n\n<ul><li><em>int s[n]:<\/em>&nbsp;the numbers on each of the squares of chocolate<\/li><li><em>int d:<\/em>&nbsp;Ron&#8217;s birth day<\/li><li><em>int m:<\/em>&nbsp;Ron&#8217;s birth month<\/li><\/ul>\n\n\n\n<p><strong>Returns<\/strong><\/p>\n\n\n\n<ul><li><em>int:<\/em>\u00a0the number of ways the bar can be divided<\/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<strong><em>n<\/em><\/strong>, the number of squares in the chocolate bar.<br>The second line contains\u00a0<strong><em>n<\/em><\/strong>\u00a0space-separated integers\u00a0<strong><em>s<\/em>[<em>i<\/em>]<\/strong>, the numbers on the chocolate squares where\u00a0<strong>0 &lt;= <em>i<\/em> &lt; <em>n<\/em><\/strong>.<br>The third line contains two space-separated integers,\u00a0<strong><em>d<\/em><\/strong>\u00a0and\u00a0<strong><em>m<\/em><\/strong>, Ron&#8217;s birth day and his birth month.<\/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><li><strong>1 &lt;= <em>s<\/em>[<em>i<\/em>] &lt;= 5<\/strong>, where (<strong>0 &lt;= <em>i<\/em> &lt; <em>n<\/em><\/strong>)<\/li><li><strong>1 &lt;= <em>d<\/em> &lt;= 31<\/strong><\/li><li><strong>1 &lt;= <em>m<\/em> &lt;= 12<\/strong><\/li><\/ul>\n\n\n\n<p><strong>Sample Input 0<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>5\r\n1 2 1 3 2\r\n3 2<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 0<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>2<\/code><\/pre>\n\n\n\n<p><strong>Explanation 0<\/strong><\/p>\n\n\n\n<p>Lily wants to give Ron<strong>\u00a0<em>m<\/em> = 2<\/strong>\u00a0squares summing to\u00a0<strong><em>d<\/em> = 3<\/strong>. The following two segments meet the criteria:<\/p>\n\n\n\n<p><strong>Sample Input 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>6\r\n1 1 1 1 1 1\r\n3 2<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>0<\/code><\/pre>\n\n\n\n<p><strong>Explanation 1<\/strong><\/p>\n\n\n\n<p>Lily only wants to give Ron\u00a0<strong><em>m<\/em> = 2<\/strong>\u00a0consecutive squares of chocolate whose integers sum to\u00a0<strong><em>d<\/em> = 3<\/strong>. There are no possible pieces satisfying these constraints:<\/p>\n\n\n\n<p>Thus, we print\u00a0<strong>0<\/strong>\u00a0as our answer.<\/p>\n\n\n\n<p><strong>Sample Input 2<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>1\r\n4\r\n4 1<\/code><\/pre>\n\n\n\n<p><strong>Sample Output 2<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>1<\/code><\/pre>\n\n\n\n<p><strong>Explanation 2<\/strong><\/p>\n\n\n\n<p>Lily only wants to give Ron\u00a0<strong><em>m<\/em> = 1<\/strong>\u00a0square of chocolate with an integer value of\u00a0<strong><em>d<\/em> = 4<\/strong>. Because the only square of chocolate in the bar satisfies this constraint, we print\u00a0<strong>1<\/strong>\u00a0as our answer.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solution_%E2%80%93_Subarray_Division\"><\/span><strong>Solution &#8211; Subarray Division<\/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#define mp make_pair\n#define pb push_back\n#define ll long long\nusing namespace std;\nint n,d,m,a[105],s[105],ans;\nint main(){\n\n    cin>>n;\n    for(int i=1;i&lt;=n;i++){\n        cin>>a[i];\n        s[i]=s[i-1]+a[i];\n    }\n    cin>>d>>m;\n\n    for(int i=m;i&lt;=n;i++)\n        if(s[i]-s[i-m]==d)\n            ans++;\n    cout&lt;&lt;ans&lt;&lt;endl;\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=\"\">n = int(input())\ns = list(map(int, input().split()))\nd, m = map(int, input().split())\n\nans = 0\nfor i in range(n-m+1):\n    if (sum(s[i:i+m]) == d):\n        ans += 1\n        \nprint(ans)<\/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.*;\nimport java.text.*;\nimport java.math.*;\nimport java.util.regex.*;\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[] squares = new int[n];\n        for(int squares_i=0; squares_i &lt; n; squares_i++){\n            squares[squares_i] = in.nextInt();\n        }\n        int d = in.nextInt();\n        int m = in.nextInt();\n        int result = 0;\n        \n        for(int i = 0; i &lt; n-m+1; i++){\n            int tmpSum = 0;\n            for(int j = i; j &lt; i+m; j++){\n                tmpSum+= squares[j];\n            } \n            if(tmpSum == d){\n                result++;\n            }\n        }\n        System.out.println(result);\n        \n    }\n}\n<\/pre>\n\n\n\n<p><strong>Disclaimer:<\/strong> The above Problem <strong>(<a href=\"https:\/\/www.hackerrank.com\/challenges\/the-birthday-bar\/problem\" target=\"_blank\" rel=\"noreferrer noopener\">Subarray Division<\/a>)<\/strong> 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 Subarray Division HackerRank Solution which is a Part of HackerRank Algorithms Series.<\/p>\n","protected":false},"author":1,"featured_media":3282,"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,190],"tags":[80,191,81,84,108,18],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"https:\/\/www.codingbroz.com\/wp-content\/uploads\/2021\/06\/subarray-division-algorithm-solution-codingbroz.png","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/3278"}],"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=3278"}],"version-history":[{"count":4,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/3278\/revisions"}],"predecessor-version":[{"id":3283,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/3278\/revisions\/3283"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media\/3282"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=3278"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=3278"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=3278"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}