How should I practice Shortest Subarray with Sum at Least K?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Apple onsite interview problems in FastPrep.

Is Shortest Subarray with Sum at Least K associated with Apple?

FastPrep tags this as a Apple onsite interview coding practice problem when the problem catalog has that company and stage context.

Shortest Subarray with Sum at Least K

Apple● HardFULLTIMEONSITE INTERVIEW

Learn

Problem statement

Return the length of the shortest nonempty contiguous subarray of nums whose sum is at least k. Return -1 if none exists.

Both the array values and k may be negative, zero, or positive. An empty input has no nonempty subarray.

Function

shortestSubarray(nums: int[], k: int) → int

Examples

Example 1

nums = [2,-1,2]k = 3return = 3

Only the whole array reaches sum three.

Example 2

nums = [1,2]k = 4return = -1

No nonempty range reaches four.

Constraints

0 <= nums.length <= 10^5.
-10^9 <= nums[i], k <= 10^9.
Use signed 64-bit or wider arithmetic for prefix sums.