TEKsystems is hiring freshers for Pune Location.

Skill : L1 Generalist - Support role
Shifts: Night shift( Cab facilities will be provided).
Experience 0-1year
Interview - F2F round (Post selection of 1st round.)

Skills required:
i) Excellent communication skills
ii) Good analytical knowledge

Work Location : Pune (Candidates from Pune or nearby places only)
Education Background: Graduate (Btech / BE / BCA /B.Sc )

If any referrals needed please reach out to pbohara@teksystems.com

Entrust Walkin Interview | Hiring Trainee Software Engineer ❤️❤️❤️

Detailed Eligibility:

Computer Science Graduates M.Sc / MCA / B.E / B.Tech (Computer Science)
2024 Passed outs Only
Experience: Freshers
Shift: General Shift (9 AM to 6 PM)

Walk In Procedure
Step 1: While coming for the Interview, please bring the interview call letter, Resume & Original Govt. ID Proof (No color xerox).
Step 2: Once you enter DLF Premises, you must register in the above link to enter the DLF Premises.

Apply from here (Direct Link): https://tinyurl.com/5xz9str3

Chocolate Types ✅

class UnionFind {
public:
    vector<int> parent, rank;
   
    UnionFind(int n) {
        parent.resize(n);
        rank.resize(n, 0);
        for (int i = 0; i < n; ++i) {
            parent[i] = i;
        }
    }

    int find(int x) {
        if (parent[x] != x) {
            parent[x] = find(parent[x]);
        }
        return parent[x];
    }

    void unite(int x, int y) {
        int rootX = find(x);
        int rootY = find(y);
        if (rootX != rootY) {
            if (rank[rootX] > rank[rootY]) {
                parent[rootY] = rootX;
            } else if (rank[rootX] < rank[rootY]) {
                parent[rootX] = rootY;
            } else {
                parent[rootY] = rootX;
                rank[rootX]++;
            }
        }
    }
};

    int minTimeToCollectPlates(vector<int>& x, vector<int>& y, int d) {
    int n = x.size();
    UnionFind uf(n);
   
   
    unordered_map<int, vector<int>> xMap, yMap;
   
    for (int i = 0; i < n; ++i) {
        xMap[x[i]].push_back(i);
        yMap[y[i]].push_back(i);
    }


    for (const auto& [coord, indices] : xMap) {
        for (int i = 1; i < indices.size(); ++i) {
            if (abs(y[indices[i]] - y[indices[i - 1]]) <= d) {
                uf.unite(indices[i], indices[i - 1]);
            }
        }
    }


    for (const auto& [coord, indices] : yMap) {
        for (int i = 1; i < indices.size(); ++i) {
            if (abs(x[indices[i]] - x[indices[i - 1]]) <= d) {
                uf.unite(indices[i], indices[i - 1]);
            }
        }
    }

   
    unordered_set<int> unique;
    for (int i = 0; i < n; ++i) {
        unique.insert(uf.find(i));
    }

    return unique.size();
}

Gamekraft ✅

Even sum code

class UserMainCode(object):
    @classmethod
    def evenSum(cls, input1: int) -> int:
      
        total_sum = 0
       
      
        for i in range(2, input1 + 1, 2):
            total_sum += i
       
        return total_sum

Even sum code
Accenture ✅

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 ✅