3731. Find Missing Elements

import java.util.*;
class Solution {
    public List<Integer> findMissingElements(int[] nums) {
        int min = Integer.MAX_VALUE, max = Integer.MIN_VALUE;
        for (int num : nums) {
            min = Math.min(min, num);
            max = Math.max(max, num);
        }
        Set<Integer> present = new HashSet<>();
        for (int num : nums) {
            present.add(num);
        }
        List<Integer> result = new ArrayList<>();
        for (int i = min; i <= max; i++) {
            if (!present.contains(i)) {
                result.add(i);
            }
        }
        return result;
    }
}

class Solution:
    def findMissingElements(self, nums: List[int]) -> List[int]:
        mn = min(nums)
        mx = max(nums)

        present = set(nums)
        ans = []

        for x in range(mn, mx + 1):
            if x not in present:
                ans.append(x)

        return ans

class Solution {
public:
    vector<int> findMissingElements(vector<int>& nums) {
        int mn = *min_element(nums.begin(), nums.end());
        int mx = *max_element(nums.begin(), nums.end());

        unordered_set<int> present(nums.begin(), nums.end());
        vector<int> ans;

        for (int x = mn; x <= mx; x++) {
            if (!present.count(x)) {
                ans.push_back(x);
            }
        }

        return ans;
    }
};

var findMissingElements = function(nums) {
    const mn = Math.min(...nums);
    const mx = Math.max(...nums);

    const present = new Set(nums);
    const ans = [];

    for (let x = mn; x <= mx; x++) {
        if (!present.has(x)) {
            ans.push(x);
        }
    }

    return ans;
};