LeetCode Entry

3731. Find Missing Elements

04.08.2026 easy 2026 kotlin rust

Find missing numbers in range min..max

3731. Find Missing Elements easy substack youtube

https://dmitrysamoylenko.com/leetcode/

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1441

Problem TLDR

Find missing numbers in range min..max

Intuition

Brute-force. Or convert to set to improve time complexity. But its only 100 elements.

Approach

• Kotlin: just subtract set from range
• Rust: use itertools minmax

Complexity

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

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

Code

    fun findMissingElements(n: IntArray)=
    (n.min()..n.max())-n.toSet()

    pub fn find_missing_elements(n: Vec<i32>) -> Vec<i32> {
        let MinMax(a,b) = n.iter().minmax() else { panic!() };
        (*a..*b).filter(|x|!n.contains(x)).collect()
    }