We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
int count = 0;
for (int k = 0; k < n; k++) {
for (int i = n; i > k; i--) {
int sum = 0;
for (int j = k; j < i; j++) {
sum += a[j];
}
if (sum < 0) count++;
}
}
System.out.println(count);
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Java Subarray
You are viewing a single comment's thread. Return to all comments →
int count = 0; for (int k = 0; k < n; k++) { for (int i = n; i > k; i--) { int sum = 0; for (int j = k; j < i; j++) { sum += a[j]; } if (sum < 0) count++; } } System.out.println(count);