Skip to content

Comments

Create Rachitec Largest sum continuos subarray#1629

Open
rachithack wants to merge 1 commit intoVAR-solutions:devfrom
rachithack:patch-1
Open

Create Rachitec Largest sum continuos subarray#1629
rachithack wants to merge 1 commit intoVAR-solutions:devfrom
rachithack:patch-1

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