Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

3644. Minimum Positive Sum Subarray

My accepted Python solution to LeetCode problem 3644, Minimum Positive Sum Subarray, running in 23ms.

  • Difficulty: Easy
  • Python
  • Runtime 23ms
  • Memory 17.4MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 23ms, memory 17.4MB, accepted 2026-01-01.

python
class Solution:
    def minimumSumSubarray(self, nums: List[int], l: int, r: int) -> int:
        n = len(nums)
        min_sum = float('inf')
        
        for length in range(l, r + 1):
            curr_sum = sum(nums[:length])
            if curr_sum > 0:
                min_sum = min(min_sum, curr_sum)
            
            for i in range(length, n):
                curr_sum = curr_sum - nums[i - length] + nums[i]
                if curr_sum > 0:
                    min_sum = min(min_sum, curr_sum)
        
        return min_sum if min_sum != float('inf') else -1

Source