Largest Sum Contiguous Subarray Problem

Largest Sum Contiguous Subarray Problem — ExecCode Easy DSA Practice

Solve the Largest Sum Contiguous Subarray problem on ExecCode. Free online easy DSA practice in Arrays / Binary Search. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the input needed to solve Largest Sum Contiguous Subarray. Your task is to compute the required answer and return maximum subarray sum. A sequence of values is given, and order matters. In Largest Sum Contiguous Subarray, the goal is to transform, count, or select values according to the exact rule. n, then array values.

Examples

Input {"nums": [-2, 1, -3, 4, -1, 2, 1, -5, 4]}; Output 6. Input {"nums": [1, 2, 3]}; Output 6. Input {"nums": [-1, -2, -3]}; Output -1

Constraints

1 <= len(nums) <= 10^5

Practice Largest Sum Contiguous Subarray free on ExecCode. Browse DSA problems, topic map, and placement guides.