shreya367 / interviewbit Goto Github PK

Hey, just check once the Question mentioned is for any array and not a sorted one, we just cannot sort the array as there will be a loss of information, let's say I have an array {3,9,6} its value will be 2 but when you sort it'll be 3.

If all the elements are negative except one and that it 0 it returns -1 instead of 1

Hi, can you tell me how you downloaded your solutions from Interviewbit? Did you scrape the website or use any automated method to get your solutions?

Hi,
I copied approximately same code as yours in C. But it is not giving output. Please can you help in finding the problem.

int* maxset(int* A, int n1, int *len1) {
int i=0, maxm =0, count =0, start =0, end =-1, fstart=-1, fend=-1;
long long int sum =0, maxsum=0;
//make a array as well
while (i<n1) {
if (A[i] >= 0) {
sum = sum+A[i];
count++;
end++;
}
if (sum > maxsum) {
maxsum = sum;
fstart = start;
fend = end;
}
else if (sum==maxsum && count>maxm){
maxm = count;
fstart = start;
fend = end;
}
if (A[i] < 0){
count =0;
start = i+1;
end = i;
sum =0;
}
i++;
}
if (fstart != -1 && fend != -1){
int res[fend-fstart];
res[0] = 0;
for (i=fstart;i<fend;i++){
// res[i] = A[i];
}
return res;
}
return -1;
}