Maximum Number of Integers to Choose from a Range I

class Solution {
public:
    int maxCount(vector<int>& banned, int n, int maxSum) {
        unordered_set<int> bad(banned.begin(), banned.end());
        long sum = 0;
        int count = 0;
        for (int i = 1; i <= n; ++i) {
            if (bad.count(i)) continue;
            if (sum + i > maxSum) break;
            sum += i;
            ++count;
        }
        return count;
    }
};

func maxCount(banned []int, n int, maxSum int) int {
    bad := map[int]bool{}
    for _, b := range banned {
        bad[b] = true
    }
    sum := 0
    count := 0
    for i := 1; i <= n; i++ {
        if bad[i] {
            continue
        }
        if sum+i > maxSum {
            break
        }
        sum += i
        count++
    }
    return count
}

from typing import List

class Solution:
    def maxCount(self, banned: List[int], n: int, maxSum: int) -> int:
        bad = set(banned)
        total = 0
        count = 0
        for i in range(1, n + 1):
            if i in bad:
                continue
            if total + i > maxSum:
                break
            total += i
            count += 1
        return count

function maxCount(banned, n, maxSum) {
    const bad = new Set(banned);
    let sum = 0;
    let count = 0;
    for (let i = 1; i <= n; i++) {
        if (bad.has(i)) continue;
        if (sum + i > maxSum) break;
        sum += i;
        count++;
    }
    return count;
}

class Solution {
    public int maxCount(int[] banned, int n, int maxSum) {
        Set<Integer> bad = new HashSet<>();
        for (int b : banned) bad.add(b);
        long sum = 0;
        int count = 0;
        for (int i = 1; i <= n; i++) {
            if (bad.contains(i)) continue;
            if (sum + i > maxSum) break;
            sum += i;
            count++;
        }
        return count;
    }
}

function maxCount(banned: number[], n: number, maxSum: number): number {
    const bad: Set<number> = new Set(banned);
    let sum = 0;
    let count = 0;
    for (let i = 1; i <= n; i++) {
        if (bad.has(i)) continue;
        if (sum + i > maxSum) break;
        sum += i;
        count++;
    }
    return count;
}