Given an integer array nums, find the contiguous subarray with the largest sum and return its sum.
Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 (subarray [4,-1,2,1]) Input: nums = [1] Output: 1
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features