Table of Contents

# Subarray Division 1 – HackerRank Solution Java , Python 3, Python 2 , C , C++, Best and Optimal Solutions , All you need.

# Solutions of Algorithms Data Structures Hard HackerRank:

## Here are all the Solutions of Hard , Advanced , Expert Algorithms of Data Structure of Hacker Rank , Leave a comment for similar posts

# 1 Month Preparation Kit Solutions – HackerRank

# C++ Subarray Division 1 HackerRank Solution

#include<bits/stdc++.h> #define mp make_pair #define pb push_back #define ll long long using namespace std; int n,d,m,a[105],s[105],ans; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; s[i]=s[i-1]+a[i]; } cin>>d>>m; for(int i=m;i<=n;i++) if(s[i]-s[i-m]==d) ans++; cout<<ans<<endl; return 0; }

# Java Subarray Division 1 HackerRank Solution

import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] squares = new int[n]; for(int squares_i=0; squares_i < n; squares_i++){ squares[squares_i] = in.nextInt(); } int d = in.nextInt(); int m = in.nextInt(); // your code goes here if(m>n){ System.out.println(0); return; } int ct = 0; int sum = 0; for(int i=0; i<m-1; i++){ sum+=squares[i]; } for(int j=m-1; j<n; j++){ sum -= (j-m)<0 ? 0 : squares[j-m]; sum += squares[j]; if(sum==d) ct++; } System.out.println(ct); } }

# Python 3 Subarray Division 1 HackerRank Solution

#!/bin/python3 import sys n = int(input().strip()) squares = list(map(int, input().strip().split(' '))) d,m = input().strip().split(' ') d,m = [int(d),int(m)] # your code goes here count = 0 for i in range(m, n+1): # print(i-m, i, squares[i-m:i], d) if sum(squares[i-m:i]) == d: count += 1 print(count)

# JavaScript Subarray Division 1 HackerRank Solution

process.stdin.resume(); process.stdin.setEncoding('ascii'); var input_stdin = ""; var input_stdin_array = ""; var input_currentline = 0; process.stdin.on('data', function (data) { input_stdin += data; }); process.stdin.on('end', function () { input_stdin_array = input_stdin.split("\n"); main(); }); function readLine() { return input_stdin_array[input_currentline++]; } /////////////// ignore above this line //////////////////// function main() { var n = parseInt(readLine()); squares = readLine().split(' '); squares = squares.map(Number); var d_temp = readLine().split(' '); var d = parseInt(d_temp[0]); // sums to this var m = parseInt(d_temp[1]); //how many blocks to sum together var count = 0; var sum; for (var i = 0; i < squares.length; i++){ sum = squares.slice(i, m + i).reduce((prev, curr) => prev + curr); if (sum === d){ count++; } } console.log(count); }

# C Subarray Division 1 HackerRank Solution

#include <math.h> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <assert.h> #include <limits.h> #include <stdbool.h> int main(){ int n; scanf("%d",&n); int *squares = malloc(sizeof(int) * n); for(int squares_i = 0; squares_i < n; squares_i++){ scanf("%d",&squares[squares_i]); } int d; int m; scanf("%d %d",&d,&m); // your code goes here int count = 0; for (int i = 0; i < n; i++) { int sum = 0; if (i + m <= n) { for (int j = 0; j < m; j++) { sum+=squares[i+j]; } if (sum == d) { count++; } } } printf("%d\n", count); return 0; }

## Leave a comment below