3483. Unique 3-Digit Even Numbers

class Solution {
    public int totalNumbers(int[] digits) {
        Set<Integer> result = new HashSet<>();
        int n = digits.length;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < n; k++) {
                    if (i == j || j == k || i == k) continue;
                    if (digits[i] == 0) continue;
                    if (digits[k] % 2 != 0) continue;
                    int num = digits[i] * 100 + digits[j] * 10 + digits[k];
                    result.add(num);
                }
            }
        }
        return result.size();
    }
}

class Solution:
    def totalNumbers(self, digits):
        result = set()
        n = len(digits)

        for i in range(n):
            for j in range(n):
                for k in range(n):

                    if i == j or j == k or i == k:
                        continue

                    if digits[i] == 0:
                        continue

                    if digits[k] % 2 != 0:
                        continue

                    num = digits[i] * 100 + digits[j] * 10 + digits[k]

                    result.add(num)

        return len(result)

class Solution {
public:
    int totalNumbers(vector<int>& digits) {

        unordered_set<int> result;
        int n = digits.size();

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < n; k++) {

                    if (i == j || j == k || i == k)
                        continue;

                    if (digits[i] == 0)
                        continue;

                    if (digits[k] % 2 != 0)
                        continue;

                    int num = digits[i] * 100
                            + digits[j] * 10
                            + digits[k];

                    result.insert(num);
                }
            }
        }

        return result.size();
    }
};

class Solution {
    totalNumbers(digits) {
        const result = new Set();
        const n = digits.length;

        for (let i = 0; i < n; i++) {
            for (let j = 0; j < n; j++) {
                for (let k = 0; k < n; k++) {

                    if (i === j || j === k || i === k) {
                        continue;
                    }

                    if (digits[i] === 0) {
                        continue;
                    }

                    if (digits[k] % 2 !== 0) {
                        continue;
                    }

                    const num =
                        digits[i] * 100 +
                        digits[j] * 10 +
                        digits[k];

                    result.add(num);
                }
            }
        }

        return result.size;
    }
}