New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Kadane's Algorithm for Largest Sum Contiguous Subarray #840

Open

manastole03 opened this issue Oct 21, 2021 · 1 comment

manastole03 commented Oct 21, 2021

🚀 Feature

Efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum.

Have you read the Contribution Guidelines?

Yes :) 💯

Pitch

Example :
Arr[] = {1,2,3,-2,5}
Output: 9

Author

manastole03 commented Oct 21, 2021

Please assign this issue to me :) 👍
@PaulEvans8669 @cr33dx @Corentin-Leffy @beardedasianlad

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment