Re: [algogeeks] Re: Find max sum of elements in an array ( with twist)

2016-01-12 Thread Saurabh Paliwal
you don't need to have arrays to store everything. A more memory efficient way is to store 2 values at each iteration whether to take this number or not. Below is a python code doing just that. def main(): numbers = map(int, raw_input().split()) maxTakingThis = 0 maxNotTaki

[algogeeks] Re: Find max sum of elements in an array ( with twist)

2016-01-12 Thread yomama
Here's a solution in javascript var data = [10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3]; function max(array) { var i = array[0]; array.forEach(function(val) { if(val > i) i = val; }); return i; } function maxSum(i, data, canSkip) { var len = data.length -

[algogeeks] Re: Find max sum of elements in an array ( with twist)

2016-01-12 Thread yomama
Here's a solution in javascript var data = [10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3]; function max(array) { var i = array[0]; array.forEach(function(val) { if(val > i) i = val; }); return i; } function maxSum(i, data, canSkip) { var len = data.length - i; if( len === 1)