Bentley is hiring Associate Software Engineer

For 2022, 2023, 2024 grads
Location: Pune

https://jobs.bentley.com/job/Pune-Associate-Software-Engineer/1178373400/?s=08

CloudSEK is hiring Frontend Engineer Intern

For 2024, 2025, 2026 grads
Location: Bangalore

https://www.cloudsek.com/openings?gh_jid=4435378004

📌Wissen Technology is hiring Java freshers [ 2024 Batch ]

Criteria: CGPA: 7.5 and above, no backlogs
Branch is CS, IT or similar with B.Tech, B.E, Mtech or programs.

Email: trupthi.shetty@wissen.com, abhay.tripathi@wissen.com

int solve(vector<int>& locs, int k) {
    int n = locs.size();
    sort(locs.begin(), locs.end());

    int ops = 0;
    
    while (!locs.empty()) {
        int tgt = locs.front();
        ops++;

        vector<int> newLocs;
        for (int i = 1; i < locs.size(); ++i) {
            int newLoc;
            if (locs[i] > tgt) {
                newLoc = locs[i] + k;
            } else {
                newLoc = locs[i] - k;
            }

            if (newLoc > 0) {
                newLocs.push_back(newLoc);
            }
        }

        locs = newLocs;
        sort(locs.begin(), locs.end());
    }

    return ops;
}

UBS getminoperations✅

Gamekraft ✅

#include <iostream>
#include <vector>
using namespace std;

int countWays(int n, int k) {
    vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
    vector<vector<int>> cumSum(n + 1, vector<int>(k + 1, 0));

    for (int i = 1; i <= k; ++i) {
        dp[1][i] = 1;
        cumSum[1][i] = cumSum[1][i - 1] + dp[1][i];
    }

    for (int len = 2; len <= n; ++len) {
        for (int j = 1; j <= k; ++j) {
            dp[len][j] = cumSum[len - 1][j / 2];
            cumSum[len][j] = cumSum[len][j - 1] + dp[len][j];
        }
    }

    return cumSum[n][k];
}

Commvault ✅

Good for 1st and 2nd yr students

If you want to start Open Source Contribution, Here are 5 beginner friendly repos where you can start by solving issues:
- CodeTriage: A tool to help developers find open issues in GitHub repositories that need attention.
https://lnkd.in/gdxsNnds

- Tirith: A policy framework that scans declarative Infrastructure as Code (IaC) configurations.
https://lnkd.in/g9RW6pE5

- RealWorld: It is a full-stack example app that demonstrates various frameworks and libraries by building the same application, a medium clone.
https://lnkd.in/gxz6sXfS

- PublicLab: It is a community where people can come together to explore environmental concerns using DIY techniques.
https://lnkd.in/gNzvXN5N

- Oppia: It is an online learning platform that enables users to create and share interactive educational activities.
https://lnkd.in/gDgZds_n

TalentCorp Hiring Graduate Trainee ❤️❤️❤️

Qualifications: BAMS, Any Graduate, B.Arch , B.Tech/B.E. , BCA , B.B.A/ B.M.S , ITI Certification , B.Sc in , B.Com , B.El.Ed , B.Ed , B.Des. , Diploma , B.A.

Experience: 0 – 3 years

Job Type: Full Time

Location:  Pune

Skills/Requirements:
1. Ability to quickly learn and adjust to new tasks and environments.
2. Strong verbal and written communication to effectively interact with colleagues and supervisors.
3. Ability to assess information, solve problems, and make data-driven decisions.
4. Working collaboratively with others, contributing to team goals, and supporting peers.

Date of Interview: 10th August, 2024

Time : 8.30 AM – 12.30 PM

Venue: TalentCorp Solutions Pvt Ltd Ground Floor, Soham Complex, Opposite Gajanan Hospital, Ranjangaon (Pune).

Electronics Art is hiring ML Engineer

For 2021, 2022, 2023 grads
Location: Hyderabad

https://ea.gr8people.com/jobs/184256/ml-engineer?sid=4&s=08

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000000;
const int SEG_TREE_SIZE = 2097152;
vector<pair<int, int>> upd[MAXN + 10];
long long rao[SEG_TREE_SIZE];
long long sum[SEG_TREE_SIZE];
void update(int t, int l, int r, int x, int y) {
    if (x < l || r < x) return;
    rao[t] += y;
    sum[t] += 1LL * x * y;
    if (l == r) return;
    update(2 * t, l, (l + r) / 2, x, y);
    update(2 * t + 1, (l + r) / 2 + 1, r, x, y);
}
void get(int t, int l, int r, long long k, long long &B) {
    if (rao[t] <= k) {
        B += sum[t];
        return;
    }
    if (k <= 0) return;
    if (l == r) {
        B += 1LL * k * l;
        return;
    }
    get(2 * t, l, (l + r) / 2, k, B);
    get(2 * t + 1, (l + r) / 2 + 1, r, k - rao[2 * t], B);
}
long getMinCost(int n, int k, vector<vector<int>> plans) {
    memset(rao, 0, sizeof(rao));
    memset(sum, 0, sizeof(sum));

    long long res = 0;

    for (const auto& plan : plans) {
        int l = plan[0];
        int r = plan[1];
        int c = plan[2];
        int p = plan[3];
        upd[l].push_back({c, p});
        upd[r + 1].push_back({-c, p});
    }

    for (int i = 1; i <= n; ++i) {
        for (const auto& operation : upd[i]) {
            update(1, 1, MAXN, operation.second, operation.first);
        }
        long long B = 0;
        get(1, 1, MAXN, min(1LL * k, rao[1]), B);
        res += B;
    }

    return res;
}

CLOUD DATA TRANSFER✅

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll solve(vector<ll>&a,vector<ll>&b,ll n,ll m)
{
    ll ans=0;
    ll s1=0,s2=0;
    ll i=0,j=0;
    while(i<n and j<m)
    {
        if(a[i]<b[j]) s1+=a[i++];
        else if(a[i]>b[j]) s2+=b[j++];
        else
        {
            ans+=max(s1,s2)+a[i];
            i++;
            j++;
            s1=0;
            s2=0;
        }
    }
    while(i<n) s1+=a[i++];
    while(j<m) s2+=b[j++];
    return max(s1,s2)+ans;
}
signed main()
{
    ll n; cin>>n;
    vector<ll>a(n);
    for(ll i=0;i<n;i++) cin>>a[i];
    ll m; cin>>m;
    vector<ll>b(m);
    for(ll i=0;i<n;i++) cin>>b[i];
    cout<<solve(a,b,n,m);
}

Cave coin collection ✅
Intuit

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

int main() {
    int k;  
    cin >> k;
    int n;  
    cin >> n;
    vector<int> arr(n);
    for (int i = 0; i < n; i++) cin >> arr[i];
    
    sort(arr.begin(), arr.end());
    
    int min_diff = 1e9;
    int best_sum = -1;
    
    for (int i = 0; i < n; i++) {
        int first = arr[i];
        
        int lb = lower_bound(arr.begin() + i + 1, arr.end(), first + k) - arr.begin();
        
        for (int j = lb - 1; j <= lb; j++) {
            if (j > i && j < n) {
                int second = arr[j];
                int diff = abs(k - (second - first));
                int sum = first + second;
                
                if (diff < min_diff || (diff == min_diff && sum > best_sum)) {
                    min_diff = diff;
                    best_sum = sum;
                }
            }
        }
    }
    
    cout << best_sum << endl;
    return 0;
}

The Chemist
Uber ✅