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 i = 0;
int j = array.length - 1;
int sum = 0;
while (i != j) {
if(sum >= 0) {
sum -= array[j];
j--;
} else {
sum +=array[i];
i++;
}
}
return sum == 0 ? true : false;
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Array
You are viewing a single comment's thread. Return to all comments →