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

Code to find Maximum sum of SubArray #52

Open
Suchit1938 opened this issue Oct 20, 2024 · 3 comments
Open

Code to find Maximum sum of SubArray #52

Suchit1938 opened this issue Oct 20, 2024 · 3 comments
Assignees
Labels
hacktoberfest2024 Hacktoberfest hacktoberfest-accepted Hacktoberfest2024

Comments

@Suchit1938
Copy link

Given an integer array nums, find the
SubArray(A subarray is a contiguous non-empty sequence of elements within an array)
with the largest sum, and return its sum.

  1. Brute Froce code Time Complexity:- O(n2)
  2. Kedan's Algorithm Time Complexity :- O(n)
@Suchit1938
Copy link
Author

Plz, assign the issue to me and add tag of hacktoberfest

@Jprerna04
Copy link
Contributor

Hi @Suchit1938 I've added the PR for this issue.
Pls check it!

@nehaaaah123
Copy link
Contributor

hi @Suchit1938 ,i've added pr issue,pls check

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
hacktoberfest2024 Hacktoberfest hacktoberfest-accepted Hacktoberfest2024
Projects
None yet
Development

No branches or pull requests

4 participants