LeetCode Entry

3364. Minimum Positive Sum Subarray

14.11.2026 easy 2026 kotlin rust

Min positive sum of subarrays of l..r length

3364. Minimum Positive Sum Subarray easy substack youtube

https://dmitrysamoylenko.com/leetcode/

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1542

Problem TLDR

Min positive sum of subarrays of l..r length

Intuition

Brute-force

Approach

• pay attention to filter negatives, flatmap if you have to

Complexity

• Time complexity: \(O(n^3)\)

• Space complexity: \(O(n)\)

Code

    fun minimumSumSubarray(n: List<Int>, l: Int, r: Int)=
    (l..r).flatMap{n.windowed(it){it.sum()}}.filter{it>0}.minOrNull()?:-1

    pub fn minimum_sum_subarray(n: Vec<i32>, l: i32, r: i32) -> i32 {
        min((l..=r).flat_map(|k|n.windows(k as _)).map(|w|w.iter().sum()).filter(|&s|s>0)).unwrap_or(-1)
    }