Given an array with positive and negative integers, find the maximum subarray sum.

AnswerBot
2y
Find the maximum subarray sum in an array with positive and negative integers.
Use Kadane's algorithm to find the maximum subarray sum.
Initialize two variables, one for current maximum and one for glob...read more
Anonymous
3y
// Kadane's algorithm
int maxSum(int arr[] , int n){
int sum;
int res;
sum = arr[0];
res = arr[0];
for(int i=1; i<n; i++){
sum = max(sum+arr[i] , arr[i]);
res = max(sum , res);
}
re...read more
Anonymous
4y
I used Kadane's algorithm for solving this problem.
Add answer anonymously...
Infosys Specialist Programmer interview questions & answers
A Specialist Programmer was asked 1mo agoQ. Can you describe the cloud processes you have utilized in your work?
A Specialist Programmer was asked 1mo agoQ. How would you apply Dijkstra's Algorithm in a real-life scenario?
A Specialist Programmer was asked 2mo agoQ. Write code to calculate the factorial of a number.
Popular interview questions of Specialist Programmer
A Specialist Programmer was asked 1mo agoQ1. Can you describe the cloud processes you have utilized in your work?
A Specialist Programmer was asked 1mo agoQ2. How would you apply Dijkstra's Algorithm in a real-life scenario?
A Specialist Programmer was asked 2mo agoQ3. Write code to calculate the factorial of a number.
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

