Skip to content
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.

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

Add Maximum Subarray Sum Algorithm #578

Open
yuvraj-rathod-1202 opened this issue Jan 25, 2025 · 1 comment
Open

Add Maximum Subarray Sum Algorithm #578

yuvraj-rathod-1202 opened this issue Jan 25, 2025 · 1 comment

Comments

@yuvraj-rathod-1202
Copy link

yuvraj-rathod-1202 commented Jan 25, 2025

I would like to implement the Maximum Subarray Sum algorithm using Kadane's Algorithm in the "pydatastructs/linear_data_structures/algorithms.py" file. This algorithm finds the contiguous subarray with the largest sum in an array, solving the problem in O(n) time complexity.

i will do below things:

  1. Implementation in pydatastructs/linear_data_structures/algorithms.py.
  2. Add unit tests to validate the implementation.
  3. Ensure proper documentation and examples in the function docs.
  4. Run existing test cases to ensure no conflicts.

This is my first contribution to the project as part of my journey toward Google Summer of Code 2025. I'm excited to learn and contribute to this repository. Feedback and suggestions are highly appreciated!

Can i go ahead?

@yuvraj-rathod-1202
Copy link
Author

remainder for approval of this issue

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant