Optimus Agency | Professional Web Development

🧠

Name things for the reader, not the writer.

Tips & tricks

Open the command palette to jump anywhere
Browse blogs and courses by track
Try the live code playground

🧠

Name things for the reader, not the writer.

Tips & tricks

Open the command palette to jump anywhere
Browse blogs and courses by track
Try the live code playground

Language

Runs in the browser · readline() reads stdin

Explorer

Maximum Subarray (Kadane's Algorithm)

solution.ts

Maximum Subarray (Kadane's Algorithm)

medium⏱ 15 mintypescriptchallengesproblem-solving-intermediate-

Exampleinput → output

Input

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

Output

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

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⁴

Every problem you solve becomes a story you can tell in an interview.

Solving under pressure trains the muscle that's most tested in onsite rounds.
Explaining your approach out loud matters more than reaching the optimal solution.
Consistency wins: 1 challenge daily > 10 challenges on one Saturday a month.

Pro tip:After solving, write 2 lines on what you learned — that's what you'll remember in the interview.

mainIdle

solution.ts

🧠

Name things for the reader, not the writer.

Tips & tricks

Open the command palette to jump anywhere
Browse blogs and courses by track
Try the live code playground

Language

Runs in the browser · readline() reads stdin

Explorer

Maximum Subarray (Kadane's Algorithm)

solution.ts

Maximum Subarray (Kadane's Algorithm)

medium⏱ 15 mintypescriptchallengesproblem-solving-intermediate-

Exampleinput → output

Input

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

Output

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

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⁴

Every problem you solve becomes a story you can tell in an interview.

Solving under pressure trains the muscle that's most tested in onsite rounds.
Explaining your approach out loud matters more than reaching the optimal solution.
Consistency wins: 1 challenge daily > 10 challenges on one Saturday a month.

Pro tip:After solving, write 2 lines on what you learned — that's what you'll remember in the interview.

mainIdle

solution.ts

Optimus Agency | Professional Web Development