๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.61K subscribers
5.61K photos
3 videos
95 files
10.6K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
def getMinServers(expected_load, server):
    n = len(server)
    server.sort(reverse=True)
    res = 0
    i = 0
    while expected_load > 0 and i < n:
        while i < n and server[i] > expected_load:
            i += 1
        if i < n:
            expected_load -= server[i]
            res += 1
            i += 1
    if expected_load > 0:
        return -1
    else:
        return res

Python 3โœ…
IBM
int solve(vector<int>& reward) {
    sort(reward.begin(), reward.end(), greater<int>());
    int total = 0;
    for(int i = 0; i < reward.size(); i++) {
        if(reward[i] - i > 0) {
            total += reward[i] - i;
        }
    }
    return total;
}

C++โœ…
int solve(vector<int>& points) {
    sort(points.begin(), points.end(), greater<int>());
    int p1 = 0, p2 = 0;
    for(int i = 0; i < points.size(); i++) {
        if(i % 2 == 0) {
            p1 += points[i];
        } else {
            p2 += points[i];
        }
    }
    return p1 - p2;
}

C++โœ