Shortest Subarray Sum At Least K Problem

Shortest Subarray Sum At Least K Problem — ExecCode Medium DSA Practice

Solve the Shortest Subarray Sum At Least K problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Practice companion for CodeFlow shortest-subarray-sum-at-least-k.

Examples

Input {"nums": [2, -1, 2], "k": 3}; Output 3. Input {"nums": [1, -6, -1, -10], "k": 3}; Output -1. Input {"nums": [17, 16, 20, 12, -6, 13], "k": 5}; Output 1

Constraints

1 ≤ n ≤ 10^5

Practice Shortest Subarray Sum At Least K free on ExecCode. Browse DSA problems, topic map, and placement guides.