Skip to content

Merge duplicate implementations of Maximum Subarray Sum #8609

Closed as not planned
@tianyizheng02

Description

@tianyizheng02

Feature description

There are multiple code files in this repo that all solve the maximum subarray sum problem, some of which are more or less duplicates. For example, these two files both implement a divide-and-conquer solution:

And I think these two both implement a sliding-window solution:

There may even be more implementations that I missed. At the very least, duplicates should be merged into a single file.

Metadata

Metadata

Assignees

No one assigned

    Labels

    enhancementThis PR modified some existing files

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions