๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.59K photos
3 videos
95 files
10.2K 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
We are hiring at Speqto Technologies Pvt. Ltd.

We are looking for:-
1) PHP Developer Fresher
2) Python Developer Fresher
3) Node JS Developer Fresher
4) React Js Developer Fresher

Job Location: Noida, Sec. 62 (work from office only).

Interested candidates can drop their updated CVs at dimpy.dutt@speqto.com
def sum_of_factors(num):
    factors_sum = 0
    i = 1
    while i * i <= num:
        if num % i == 0:
            factors_sum += i
            if i != num // i:
                factors_sum += num // i
        i += 1
    return factors_sum

All test cases passing

//Max Subset Sum
vector<int> playOfGlasses(int c1, int w1, int c2, int w2, int c3, int w3) {
        // code here
        int t;
        for (int i = 0; i < 3; ++i) {
        t = min(w1, c2 - w2);
        w1 -= t;
        w2 += t;
       
        t = min(w2, c3 - w3);
        w2 -= t;
        w3 += t;
       
        t = min(w3, c1 - w1);
        w3 -= t;
        w1 += t;
        }
        t = min(w1, c2 - w2);
        w1 -= t;
        w2 += t;
    return {w1, w2, w3};
    }

Play of glasses
GFGโœ…
๐Ÿ‘3