Description of Changes:
Kadane's Algorithm efficiently finds the maximum sum of a contiguous subarray within a one-dimensional array of numbers. The problem is to find the largest sum possible by summing a sequence of consecutive elements from the array.
đ Contributor Info_
Isha Patil
â Checklist Before Submitting
[x] I have checked the code for errors and ensured it follows the project's guidelines.
[x] I have read the contribution guidelines.
[x] I have participated in related discussions or created an issue if necessary.
[x] I have included my name above.
đŁ Additional Comments
Anything else you want to share about this PR? Feedback, suggestions, or additional info? Let us know!
Thank you for contributing! đ Your participation helps make this project better. Let's grow together
âŚ#338te Kadane'sAlgo.java
đ¤ Join the Discussion!
Thank you for contributing! Before you submit this Pull Request, please take a moment to:
đ PR Details
Description of Changes:
Kadane's Algorithm efficiently finds the maximum sum of a contiguous subarray within a one-dimensional array of numbers. The problem is to find the largest sum possible by summing a sequence of consecutive elements from the array.
đ Contributor Info_
Isha Patil
â Checklist Before Submitting
đŁ Additional Comments
Anything else you want to share about this PR? Feedback, suggestions, or additional info? Let us know!
Thank you for contributing! đ Your participation helps make this project better. Let's grow together