Tap here to switch tabs
Problem
Submissions

Problem: Minimum Size Subarray in Infinite Array

Minimum Size Subarray in Infinite Array repeats a positive-integer array forever; find the shortest contiguous subarray whose sum equals target, or return -1 if none exists.

Statement

You are given a 00 indexed integer array nums and an integer target.

Consider an infinite array infinite_nums formed by repeating nums infinitely many times.

Return the minimum length of a subarray in infinite_nums whose elements sum to target. If no such subarray exists, return −1-1.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5

  • 1≤1 \leq nums[i] ≤105\leq 10^5

  • 1≤1 \leq target ≤109\leq 10^9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Size Subarray in Infinite Array

Minimum Size Subarray in Infinite Array repeats a positive-integer array forever; find the shortest contiguous subarray whose sum equals target, or return -1 if none exists.

Statement

You are given a 00 indexed integer array nums and an integer target.

Consider an infinite array infinite_nums formed by repeating nums infinitely many times.

Return the minimum length of a subarray in infinite_nums whose elements sum to target. If no such subarray exists, return −1-1.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5

  • 1≤1 \leq nums[i] ≤105\leq 10^5

  • 1≤1 \leq target ≤109\leq 10^9