Sliding window: maintain the shortest window that satisfies a threshold

Sliding window: Given a positive-integer array nums and a positive target, return the minimum length of a contiguous subarray whose sum is at least target. Return 0 when no such subarray exists.

Input: A JSON object { "nums": number[], "target": number }.

Output: A JSON integer containing the minimum qualifying length, or 0.

Constraints:

0 <= nums.length <= 100000
Every nums value is a positive integer
target is a positive integer

Read one JSON value from stdin and print exactly one JSON-serialized answer to stdout with no extra text.

Difficulty: HARD. Variant: 21. Balance correctness, maintainability, and clear review-ready code.

Practice context

This coding (algo) exercise trains prompt interpretation, explicit assumptions, a concrete response, and a concise explanation of the decisions made. It is marked hard difficulty.

The signed-in workspace provides the tools requ

What this task practices

This coding (algo) exercise trains the same sequence expected in an interview: understand the prompt, make assumptions explicit, produce a concrete answer, and explain the decisions behind it. The task is marked hard difficulty. The private workspace adds the tools required by this round, such as recording, code execution, diagrams, evidence panels, or structured notes. It also preserves the attempt so later feedback can be compared with previous work. Evaluation is based on task-specific criteria and the candidate seniority selected in the preparation path. Public pages never expose the reference solution, hidden tests, evaluator instructions, or another candidate’s work.