# Largest Sum Contiguous Subarray

We have a sequence of integers and we need the maximum sum from the continuous sub-sequences. Example- Let the sequence of integers be (3,-4,5,-7,8,-6,21,-14,-9,19). Then,the sub-array or sub-sequence with maximum sum is (8,-6,21) and the maximum sum is 23. Brute Force- We can check sums of all sequences of different sizes from 1 to N.Its […]

Continue reading →