Given an array and target, find the minimum length of a contiguous subarray whose sum ≥ target. Return 0 if none.
Input: target=7, nums=[2,3,1,2,4,3] Output: 2 ([4,3]) Input: target=4, nums=[1,4,4] 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