Vibe Coding Arena

Initializing model...

Maximum Subarray

easy

Given an integer array `nums`, find the subarray with the largest sum, and return its sum.

A subarray is a contiguous non-empty sequence of elements within an array.

Function Signature

def max_subarray(nums: list[int]) -> int:

Examples

Input: nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]

Output: 6

The subarray [4, -1, 2, 1] has the largest sum 6.

Input: nums = [1]

Output: 1

Loading editor...

Describe your solution

Ctrl+Enter — generates template, edit manually

Generated code may need editing — that's the challenge! Your vibe coding skill is tested by how well you prompt the AI and how well you fix the code it generates.

Test Results

Test 1

max_subarray([-2, 1, -3, 4, -1, 2, 1, -5, 4])

Expected: 6

Test 2

max_subarray([1])

Expected: 1

Test 3

max_subarray([5, 4, -1, 7, 8])

Expected: 23

Run tests to see results

Score

Time0:00

Prompts0

Submit a passing solution to see your score