OpenGenus/cosmos

Largest sum Continuous Array Problem

Open

#444 opened on Oct 4, 2017

View on GitHubContributor guide
 (15 comments) (0 reactions) (0 assignees)C++ (3,724 forks)batch import
Hacktoberfestadd codenew algorithm

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

For eg :- If the array is -3 2 -1 0 4 7 then the largest sum is 12 ( 2+(-1)+0+4+7)

Contributor guide

Research direction
Implement Kadane's algorithm to find the maximum sum of a contiguous subarray in C++. Add a function that takes an array and returns the maximum sum. Include test cases with the given example and edge cases.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++Git
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70