You are given a $0$ 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$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^5$

• $1 \leq$ target $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.