Skip to content
This repository was archived by the owner on Jan 12, 2024. It is now read-only.

Latest commit

 

History

History
30 lines (17 loc) · 480 Bytes

week3-challenge.md

File metadata and controls

30 lines (17 loc) · 480 Bytes

Problem 1

Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K.

If there is no non-empty subarray with sum at least K, return -1.

A defanged IP address replaces every period "." with "[.]".

Example 1:

Input: A = [1], K = 1 Output: 1

Example 2:

Input: A = [1,2], K = 4 Output: -1

Example 3:

Input: A = [2,-1,2], K = 3 Output: 3

Notes:

  • -1 <= A.length <= 50000
  • -10 ^ 5 <= A[i] <= 10 ^ 5
  • 1 <= K <= 10 ^ 9