2875. Minimum Size Subarray in Infinite Array

LeetCodeArrayHash TableSliding WindowPrefix SumOpen on judge ↗

You are given a 0-indexed array nums and an integer target. A 0-indexed array infinite_nums is generated by infinitely appending the elements of nums to itself. Return the length of the shortest subarray of the array infinite_nums with a sum equal to target. If there is no such subarray return -1. Example 1: Input: nums = [1,2,3], target = 5 Output: 2 Explanation: In this example infinite_nu

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