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

Create Rachitec Largest sum continuos subarray #1629

Open
wants to merge 1 commit into
base: dev
Choose a base branch
from

Conversation

rachithack
Copy link

This code is Largest sum continuos subarray they are Given a zero index array find the sum of contiguos subarray which has the largest sum.
Time-complexity: O(n), Auxiliary space: O(1),Implementation
This algorithm doesn’t work for negative numbers,it simply returns zero if all numbers are negative.

This code is Largest sum continuos subarray they are Given a zero index array find the sum of contiguos subarray which has the largest sum.
Time-complexity: O(n), Auxiliary space: O(1),Implementation
This algorithm doesn’t work for negative numbers,it simply returns zero if all numbers are negative.
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

Successfully merging this pull request may close these issues.

1 participant