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.

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

Added Kadane's Algorithm Problem #473

Merged
merged 1 commit into from
Oct 3, 2021
Merged

Added Kadane's Algorithm Problem #473

merged 1 commit into from
Oct 3, 2021

Conversation

sudipbhakat07
Copy link
Contributor

Problem

  • Given an array Arr[] of N integers. Find the contiguous sub-array(containing at least one number) which has the maximum sum and return its sum.

Solution

  • Have done the solution using Kadane's Algorithm.

@fineanmol fineanmol merged commit d7d36aa into fineanmol:master Oct 3, 2021
@fineanmol fineanmol added the hacktoberfest-accepted Accept for hacktoberfest, will merge later label Oct 3, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
hacktoberfest-accepted Accept for hacktoberfest, will merge later
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@sudipbhakat07 @fineanmol