Hello Programmers/Coders, Today we are going to share solutions of Programming problems of HackerRank of Programming Language Java . At Each Problem with Successful submission with all Test Cases Passed, you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for Java Subarray-HackerRank Problem. We are providing the correct and tested solutions of coding problems present on HackerRank. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

Introduction To Java

JAVA was developed by James Gosling at Sun Microsystems Inc in the year 1991, later acquired by Oracle Corporation. It is a simple programming language. Java makes writing, compiling, and debugging programming easy. It helps to create reusable code and modular programs.

Java is a class-based, object-oriented programming language and is designed to have as few implementation dependencies as possible. A general-purpose programming language made for developers to write once run anywhere that is compiled Java code can run on all platforms that support Java. Java applications are compiled to byte code that can run on any Java Virtual Machine. The syntax of Java is similar to c/c++.

Link for the Problem – Java Subarray – Hacker Rank Solution

Java Subarray – Hacker Rank Solution

Problem :

We define the following:

• A subarray of an -element array is an array composed from a contiguous block of the original array’s elements. For example, if , then the subarrays are , , , , , and . Something like  would not be a subarray as it’s not a contiguous subsection of the original array.
• The sum of an array is the total sum of its elements.
  • An array’s sum is negative if the total sum of its elements is negative.
  • An array’s sum is positive if the total sum of its elements is positive.

Given an array of  integers, find and print its number of negative subarrays on a new line.

Problem Statement; Click Here.

Java Subarray – Hacker Rank 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 sc = new Scanner(System.in);


    int length = sc.nextInt();


    int[] arr = new int[length];



    int first = sc.nextInt();


    arr[0] = first;


    int count = first < 0 ? 1 : 0;



    for (int i = 1; i < length; i++){


        int num = sc.nextInt();


        arr[i] = arr[i - 1] + num;



        if (arr[i] < 0){


            count++;


        }



        for (int j = 0; j < i; j++){


            int sub_result = arr[i] - arr[j];


            if (sub_result < 0){


                count++;


            }


        }


    }



    System.out.print(count);


    }


}