You are given an integer array nums and two integers l and r.

Find the minimum sum of a contiguous subarray whose length is between l and r, inclusive, such that the sum is strictly greater than $0$.

Return the minimum positive sum among all valid subarrays. If no such subarray exists, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ l $\leq$ r $\leq$ nums.length

• $-1000 \leq$ nums[i] $\leq 1000$

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.