Skip to content

[FEATURE]Create Kadane's Algorithm #1038

@AlKun25

Description

@AlKun25

It is a very commonly used algorithm for sub-array problems.

Detailed Description

It is most famously used in the "maximum sum of sub array" question. The reason being that Kadane's algorithm has a time complexity of O(n), in comparison to the O(n^2) using traditional methods.

Context

Sub-array problems are very common kind of questions, also asked in many Coding Interviews.
There have been multiple pull requests made to include Kadane's algorithm in the repository.
This only supplements the importance of adding this algorithm to the repository.
Also this is one of the unknown type of algorithm, which can help a lot.

Possible Implementation

Multiple pull requests are available by the name "Kadane" in the very same repository

I hope this issue will be attended and dealt with.

Metadata

Metadata

Assignees

No one assigned

    Labels

    enhancementNew feature or request

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions