LeetCode Entry

3886. Sum of Sortable Integers

20.10.2026 hard 2026 kotlin rust

Sum of chunks lengths that could split then cycle to sort array

3886. Sum of Sortable Integers hard substack youtube

https://dmitrysamoylenko.com/leetcode/

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1517

Problem TLDR

Sum of chunks lengths that could split then cycle to sort array

Intuition

Brute-force: for every divisor, check if chunk can be sorted by cycling and that previous chunk is less than current

Approach

• join 2 junks and count longest sorted sequence
• compare previous chunk max with current chunk min

Complexity

• Time complexity: \(O(nsqrt(n))\)

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

Code

    fun sortableIntegers(n: IntArray): Int =
    (1..n.size).filter { n.size % it == 0 }.sumOf { k ->
        val c = n.toList().chunked(k)
        if (c.all { b -> b.indices.count { b[it] > b[(it + 1) % k] } <= 1 } &&
            c.zipWithNext().all { (a, b) -> a.max() <= b.min() }) k else 0
    }

    pub fn sortable_integers(n: Vec<i32>) -> i32 {
        (1..=n.len()).filter(|&k| n.len() % k == 0
            && n.chunks(k).all(|c| c.iter().cycle().take(k + 1).tuple_windows().filter(|(a, b)| a > b).count() <= 1)
            && n.chunks(k).tuple_windows().all(|(a, b)| a.iter().max() <= b.iter().min())
        ).sum::<usize>() as _
    }