Kadane’s Algorithm: Largest Sum Contiguous Subarray

[Jvs21]

🚀 Feature

Implement Kadane’s Algorithm to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum.

Have you read the Contribution Guidelines?

Yes

Pitch

Uses O(1) space and takes O(n) time.

Assignees

(Do not make changes in this section until asked to do so)
C - @anshkush92college
C# -
C++ - @tm2k23
Go -
Java - @Jvs21
Javascript -
Kotlin -
Python - @anushkarthik05

[Jvs21]

@manan025 Would like to contribute in Java

[tm2k23]

Hey, I would like to contribute in C++, please assign it to me.

[anushkarthik05]

@manan025 I would like to contribute in Python

[manan025]

@Jvs21 - Java
@tm2k23 - C++
@anushkarthik05 - Python
assigned

[sachin4627]

@manan025 for java kadane's assign to me, someone else is already merged for java.

[manan025]

@sachin4627 The algorithm has been written in Java and has been merged to the main repo too. So, I can't assign in the same language again.

[tm2k23]

Hey @manan025 since I am a beginner at open-source, I just had a query.
After forking the repo, and merging my pull request, there won't be any effect even if I delete the forked repo from my profile
Right?

[manan025]

Once I merge your PR, you can delete forked repo.

[tm2k23]

ok, thank you.

[anshkush92]

@manan025 can you assign this to me in C.

[manan025]

@anshkush92college - C assigned