3718. Smallest Missing Multiple of K

class Solution {
    public int missingMultiple(int[] nums, int k) {
        Set<Integer> set = new HashSet<>();
        for (int num : nums) {
            set.add(num);
        }

        int multiple = k;
        while (set.contains(multiple)) {
            multiple += k;
        }

        return multiple;
    }
}

class Solution:
    def missingMultiple(self, nums, k):
        num_set = set(nums)

        multiple = k

        while multiple in num_set:
            multiple += k

        return multiple

class Solution {
public:
    int missingMultiple(vector<int>& nums, int k) {
        unordered_set<int> numSet;

        for (int num : nums) {
            numSet.insert(num);
        }

        int multiple = k;

        while (numSet.count(multiple)) {
            multiple += k;
        }

        return multiple;
    }
};

class Solution {
    missingMultiple(nums, k) {
        const numSet = new Set(nums);

        let multiple = k;

        while (numSet.has(multiple)) {
            multiple += k;
        }

        return multiple;
    }
}