CodeDojo | Learn deeply. Build confidently.

Name things for the reader, not the writer.

Tips & tricks

Name things for the reader, not the writer.

Tips & tricks

Language

Runs in the browser · readline() reads stdin

DOJO PETYour little coding companion

solution.ts

Maximum Subarray (Kadane's Algorithm)

medium⏱ 15 mintypescriptchallengesproblem-solving-intermediate-

LEARN BY DOINGPut your intuition to work3 steps

Maximum Subarray (Kadane's Algorithm)

Choose one small test case. What result do you expect, and why?

Use the lesson’s examples and explanation to check your idea.

Personal reflection. Nothing is sent to an AI service.

Exampleinput → output

Input

9
-2 1 -3 4 -1 2 1 -5 4

Output

Sample case — your program reads stdin and prints to stdout.

Starter

Find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Use Kadane's Algorithm: Track current sum and max sum. If current sum becomes negative, reset it.

Example: [-2,1,-3,4,-1,2,1,-5,4] → Subarray [4,-1,2,1] has largest sum = 6

Input format Line 1: n. Line 2: n space-separated integers.

Output format The maximum subarray sum.

Constraints 1 ≤ n ≤ 10⁵, -10⁴ ≤ nums[i] ≤ 10⁴

Name things for the reader, not the writer.

Tips & tricks

CodeDojo | Learn deeply. Build confidently.