Cosmos: Largest sum Continuous Array Problem

Created on 4 Oct 2017  路  15Comments  路  Source: OpenGenus/cosmos

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

Hacktoberfest add code new algorithm
Source
picture Arunraj97

All 15 comments

can i do this in c++?

alphaWizard picture alphaWizard on 4 Oct 2017
❤1

Sure @alphaWizard Go for it 馃憤

AdiChat picture AdiChat on 4 Oct 2017

I wrote this awhile back in JavaScript

cmckni3 picture cmckni3 on 4 Oct 2017
❤1

@cmckni3 Feel free to add a pull request 馃憤

AdiChat picture AdiChat on 4 Oct 2017

Can I try this in Java?

AlexanderDavid picture AlexanderDavid on 4 Oct 2017
❤1

Can I try it in python?

AK-007 picture AK-007 on 4 Oct 2017
❤1

Sure @AlexanderDavid @AK-007 Go ahead 馃憤

AdiChat picture AdiChat on 4 Oct 2017

where do we have to add the file?

namish800 picture namish800 on 4 Oct 2017
👍1

This code should be placed at code/dynamic programming/largest sum contiguous subarray 馃憤

AdiChat picture AdiChat on 4 Oct 2017

465 Added in Python and tested the same !!!

devAmoghS picture devAmoghS on 4 Oct 2017
❤1

471 Added in Java

juniorjainsahab picture juniorjainsahab on 4 Oct 2017

Review my PR https://github.com/OpenGenus/cosmos/pull/462

namish800 picture namish800 on 4 Oct 2017

PR #476 Implemented.

AK-007 picture AK-007 on 4 Oct 2017

I'd like to implement this in Haskell.

setupminimal picture setupminimal on 4 Oct 2017
❤1

If you want to check your solution, you can use hackerrank

BrianBohe picture BrianBohe on 5 Oct 2017
❤1
Was this page helpful?
0 / 5 - 0 ratings

Related issues

skywalker212 picture skywalker212  路  3Comments
sebasrp picture sebasrp  路  3Comments
athangkanos picture athangkanos  路  4Comments
mansiag picture mansiag  路  3Comments
arnavb picture arnavb  路  3Comments