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 Goldman Sachs phone screen problems in FastPrep.

Is Shortest Subarray with Sum at Least K associated with Goldman Sachs?

FastPrep tags this as a Goldman Sachs phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Shortest Subarray with Sum at Least K

Learn this problem

● Hard

Goldman SachsFULLTIMEPHONE SCREEN

Problem statement

Given a signed integer array nums and an integer k, return the length of the shortest nonempty contiguous subarray whose sum is at least k.

Return -1 if no such subarray exists.

Function

shortestSubarrayAtLeastK(nums: int[], k: long) → int

Examples

Example 1

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

Only the entire array reaches sum 3.

Example 2

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

No subarray reaches 4.

Constraints

1 <= nums.length <= 200000
-10^9 <= nums[i] <= 10^9
1 <= k <= 10^18