Please find the max sum of any sub array in a bigger array. Please code it in Java. Basically find a sub array in a larger array, where the sum of all the elements in the sub array is the maximum sum that you can make.

Question

Please find the max sum of any sub array in a bigger array.  Please code it in Java. Basically find a sub array in a larger array, where the sum of all the elements in the sub array is the maximum sum that you can make.

Anonymous · Accepted Answer

I struggled. Its better to have two pointers and iterate down the list.  See online or cracking the coding interview.

Anonymous · Answer

Kadane's Algorithm

Equilar

Equilar interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches