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

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.
Help your peers!
Select
Add answer anonymously...

Top Specialist Programmer Interview Questions Asked at Infosys

Q. Can you describe the cloud processes you have utilized in your work?
Q. How would you apply Dijkstra's Algorithm in a real-life scenario?
Q. Write code to calculate the factorial of a number.

Interview Questions Asked to Specialist Programmer at Other Companies

Top Skill-Based Questions for Infosys Specialist Programmer

Specialist Programmer Interview Questions
Stay ahead in your career. Get AmbitionBox app
play-icon
play-icon
qr-code
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

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.

Follow Us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter
Profile Image
Hello, Guest
AmbitionBox Employee Choice Awards 2025
Winners announced!
awards-icon
Contribute to help millions!
Write a review
Write a review
Share interview
Share interview
Contribute salary
Contribute salary
Add office photos
Add office photos
Add office benefits
Add office benefits