Closed as not planned
Description
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.