Shortest Sub-Array with sum at least K

CodeChefOpen on judge ↗

Return the length of the shortest, non-empty, contiguous subarray of an Array, A, with sum at least K. If there is no non-empty subarray with sum at least K, return -1. Input Format T A1 A B C D E ... K1 A2 A B C D E ... K2 A3 A B C D E ... K3 ... Where T is the number of Arrays to be checked; A1, A2, A3, etc. are the Number of Elements in each Array; A, B, C, D, E, etc. are the subsequent ele

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI