Truefan is hiring Devops Engineer

For 2023, 2024 grads
Location: Gurugram

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

For all the opportunities, check the job description and see if you are eligible, you are fulfilling 50-60% of job description, update your resume with all the keywords and Apply!!

Best of luck guys 😇❤️

Company Name : Coinbase
Role : SDE Internship
Batch : 2026 passouts

Link : https://www.coinbase.com/en-gb/careers/positions/6266456?gh_jid=6266456&gh_src=20687b321us

Cuti group Hiring !!
Role - Apps Programmer analyst
Exp - 0 to 2 year

Link - https://jobs.citi.com/job/-/-/287/71615296816

Hiring Software Trainees - WALK IN DRIVE 2024
https://forms.office.com/pages/responsepage.aspx?id=fretDtxC-Ee74-wjleBxLIgr3q69FJpOkbdJifu1Fl5UMlpIU0kwV1k0SU9TSE1UVk9ON1VGUTgwVy4u&origin=QRCode&route=shorturl

#include <bits/stdc++.h>
using namespace std;
int overlap(string a, string b) {
    int m = a.length(), n = b.length();
    int v = 0;
        for (int i = 1; i <= min(m, n); i++) {
        if (a.substr(m - i) == b.substr(0, i)) {
            v = i;
        }
    }
    return v;
}

int maxScore(int N, vector<string>& LIST, vector<int>& POINTS, int limit) {
    vector<int> dp(limit + 1, 0); 
    for (int i = 0; i < N; i++) {
        int len = LIST[i].length();
        int points = POINTS[i];
        for (int j = len; j <= limit; j++) {
            dp[j] = max(dp[j], dp[j - len] + points);
        }
        for (int k = 0; k < N; k++) {
            if (i == k) continue; 
            int ov = overlap(LIST[i], LIST[k]);
            int new_len = len + LIST[k].length() - ov;
            int new_points = points + POINTS[k];
            for (int j = new_len; j <= limit; j++) {
                dp[j] = max(dp[j], dp[j - new_len] + new_points);
            }
        }
    }
    return dp[limit];
}

Construct Best String ✅
Stonewain

Looking for talented freshers who are willing to build their career as a Data Analyst / Data Engineer.

📝Mandatory Skills:
✨SQL
✨Python
✨PoweBI
✨Tableau

💌 Interested candidates share your resume via email to beula.nadar@hansacequity.com

If useful show 👍🏻

#include <bits/stdc++.h>
using namespace std;
int minCostToCleanDataset(string dataset, int ox, int oy) {
    unordered_map<char, int> freq;
    for (char c : dataset) {
        freq[c]++;
    }
    int r = 0;
    int t = 0;
    for (auto &entry : freq) {
        int count = entry.second;
        t += (count / 2) * ox;
        if (count % 2 != 0) {
            r++;
        }
    }
    t += (r / 2) * oy;
    return t;
}

Amazon ✅

vector<int> solve(int n, vector<vector<int>> m) {
    vector<int> t(n, 0);
    vector<int> w(n, 0);

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(m[i][j] == 1) {
                t[i]++;
            }
        }
    }

    int maxi = *max_element(t.begin(), t.end());

    for(int i = 0; i < n; i++) {
        if(t[i] + count(m[i].begin(), m[i].end(), 2) >= maxi) {
            w[i] = 1;
        }
    }

    return w;
}

Stonewain ✅

def ss(C):
    if len(C) < 10 or len(C) > 12:
        return C[-1]
    F = C[:3]
    if len(set(F)) != 3 or not all(c.isupper() for c in F):
        return C[-1]
    Y = C[3:7]
    if not Y.isdigit() or not (1900 <= int(Y) <= 2019):
        return C[-1]
    D = C[7:-1]
    v = {'10', '20', '50', '100', '200', '500', '1000'}
    if D not in v:
        return C[-1]
    l = C[-1]
    if not (l.isupper() and len(l) == 1):
        return C[-1]
    return C[0]

Practo ✅

Thoughtworks is hiring for Application Developer role.

Batch eligible: 2023 and 2024 grads

Internal hiring hai, Kisi bhi employee se referral lekr apply krdo from LinkedIn!!

#include <iostream>
#include <vector>
#include <iomanip>
#include <numeric>
#include <string>
#include <sstream>
using namespace std;
string largestSegment(vector<int> radii, int segments) {
    const double pi = 3.14159265359;
    int n = radii.size();
    vector<double> areas(n);
    
    for (int i = 0; i < n; ++i) {
        areas[i] = pi * radii[i] * radii[i];
    }

    double totalArea = accumulate(areas.begin(), areas.end(), 0.0);
    double low = 0, high = totalArea / segments;

    auto canCutSegments = [&](double x) {
        int count = 0;
        for (double area : areas) {
            count += static_cast<int>(area / x);
        }
        return count >= segments;
    };

    while (high - low >= 1e-4) {
        double mid = (low + high) / 2;
        if (canCutSegments(mid)) {
            low = mid;
        } else {
            high = mid;
        }
    }

    stringstream ss;
    ss << fixed << setprecision(4) << low;
    return ss.str();
}

Lumber ✅

Cencora is hiring Software Engineer

For 2022, 2023, 2024 grads
Location: Pune

Link 🔗
https://careers.cencora.com/us/en/job/CHKCENUSR2312525EXTERNALENUS/Software-Engineer-I-Software-Engineering

Interested Candidates Kindly reach out to
Kavya
+91-9148284616
Mail: kavya.j@jaastechnologies.com

+91-6366837444
hr@jaastechnologies.com

public static int getTripletCount(List<Integer> a, int d) {
        int T = 0;
        HashMap<Integer, Integer> H = new HashMap<>();

        for (int k = 2; k < a.size(); k++) {
            int key = a.get(k) % d;
            H.put(key, H.getOrDefault(key, 0) + 1);
        }

        for (int j = 1; j < a.size(); j++) {
            if (j >= 2) {
                H.put(a.get(j) % d, H.get(a.get(j) % d) - 1);
            }

            for (int i = 0; i < j; i++) {
                int matchingVal = (d - (a.get(i) + a.get(j)) % d) % d;
                int toAdd = H.getOrDefault(matchingVal, 0);
                T += toAdd;
            }
        }

        return T;
    }

Preemptive Scheduling ✅