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++✅

Zycus Hiring Anuglar Developer

Batch - 2020/2021/2022

Link: https://zycus.skillate.com/jobs/43113

Sprinklr Hiring Product Analyst

Batch - 2023/2022/2021

Link - https://sprinklr.wd1.myworkdayjobs.com/en-US/careers/job/India---Haryana---Gurgaon/Product-analyst_107446-JOB

Ericsson Hiring Automation Analyst

Link - https://jobs.ericsson.com/careers/job/563121757320992-automation-analyst-gurgaon-haryana-india?domain=ericsson.com

Only 2024 Batch

Note : BE/Btech are not eligible

https://usrecruiting.deloitte.com/usi-open-talent-network-risk-and-financial-advisory#subpage/undergraduate/section/nkljb

Forbes Advisor hiring Data Research

Only 2023 Batch

https://www.linkedin.com/jobs/view/3779121039/

Batch only 2021/2022/2023

https://jobsearch.maersk.com/jobposting/index.html?id=TR-326572

Company Name: Autodesk

Batch: 2023 passouts

Role: Software Engineer Apprentice

Apply Link : https://autodesk.wd1.myworkdayjobs.com/en-US/uni/job/Apprentice--Software-Engineer--For-2023-Graduates-Only-_23WD74228

Happy People✅
ABInBev

#include <bits/stdc++.h>
using namespace std;

const int MX = 1e6 + 5;
int mu[MX], pre[MX], cnt[MX];

void Sieve() {
    vector<int> prime;
    vector<bool> isComp(MX, false);
    mu[1] = 1;
    for (int i = 2; i < MX; ++i) {
        if (!isComp[i]) {
            prime.push_back(i);
            mu[i] = -1;
        }
        for (int j = 0; j < prime.size() && i * prime[j] < MX; ++j) {
            isComp[i * prime[j]] = true;
            if (i % prime[j] == 0) {
                mu[i * prime[j]] = 0;
                break;
            } else {
                mu[i * prime[j]] = -mu[i];
            }
        }
    }
    for (int i = 1; i < MX; ++i) {
        pre[i] = pre[i - 1] + mu[i];
    }
}

long long KGCD(int N, int K) {
    if (K == 0) return 0;
    N /= K;
    long long res = 0;
    for (int l = 1, r; l <= N; l = r + 1) {
        r = N / (N / l);
        res += 1LL * (N / l) * (N / l) * (pre[r] - pre[l - 1]);
    }
    return res;
}

int main() {
    Sieve();
    int T;
    cin >> T;
    while (T--) {
        int N, K;
        cin >> N >> K;
        cout << KGCD(N, K) << "\n";
    }
    return 0;
}



GCD Chegg✅
Source :Hola

#include<bits/stdc++.h>
using namespace std;

vector<long long> solve(long long m1, long long m2) {
    vector<long long> res(3);
    for (long long i = 1; ; ++i) {
        if (i <= m1 && (i > m2 || m1 >= m2)) {
            m1 -= i;
        } else if (i <= m2 && (i > m1 || m2 > m1)) {
            m2 -= i;
        } else {
            res[0] = i;
            res[1] = m1;
            res[2] = m2;
            break;
        }
    }
    return res;
}

int main() {
    long long m1, m2;
    cin >> m1 >> m2;
    vector<long long> res = solve(m1, m2);
    cout << res[0] << " " << res[1] << " " << res[2] << "\n";
    return 0;
}



Computer Crash✅