UBS is hiring Interns

For 2023, 2024, 2025 grads

https://jobs.ubs.com/TGnewUI/Search/home/HomeWithPreLoad?jobid=304700&codes=fv&siteid=5012&partnerid=25008&PageType=JobDetails#jobDetails=304700_5012

Natoma is hiring SWE

For 2021, 2022, 2023 grads
Location: Bangalore

https://app.dover.com/apply/natoma/2060a3ed-f24a-4446-96ab-ca0fd584cd32?rs=42706078

public static int getMaxEfficiency(int[] arrivalTime) {
        Arrays.sort(arrivalTime);
       
        int maxEfficiency = Integer.MIN_VALUE; 
        int n = arrivalTime.length;
        int left = 0;

        for (int right = 1; right < n; right++) {
            while (left < right && arrivalTime[right] - arrivalTime[left] > right - left) {
                left++;
            }
            int activeTime = arrivalTime[right] - arrivalTime[left];
            int testCases = right - left + 1;
            int efficiency = testCases - activeTime;
            maxEfficiency = Math.max(maxEfficiency, efficiency);
        }

        return maxEfficiency;
    }

Expedia ✅

dentsu is hiring for SQL Developer

CTC : 5 - 9 LPA
Eligibility : Entry Level

Apply Here : https://dentsuaegis.wd3.myworkdayjobs.com/DAN_GLOBAL/job/Bangalore/SQL-Developer_R1040066-1

techolution is looking for talented Python Interns to join our innovative team.

Location: Hyderabad (Onsite)
Eligible Batch: 2024/2025
Duration: 6 months - 12 months

Key Skills Required to Apply:
Proficiency in Modular Object Oriented Python Coding.
Experience with Flask/Django/FastAPl
Strong knowledge of Data Structures & Algorithms
Exposure to backend development
Knowledge of microservices architecture
Familiarity with cloud platforms (AWS/Azure/GCP)
Deployment experience with Docker/Kubernetes

If you believe that you match the criteria, share your resume at cavery.mahajan@techolution.com

NXP WIT Mentorship Program 2024 for Females
Stipend: INR 50,000

Registration Link: https://wit.nxp.com/

Do share with your Juniors too

One more candidate got offer ❤

Maximum Product
Wipro ✅

Camel Case
Wipro ✅

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

int main() {
    long long n;
    cin >> n;

    long long ans = 0;


    for (long long i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ans += i;
            if (i != n / i) {
                ans += n / i;
            }
        }
    }

    cout << ans << endl;

    return 0;
}

Sum of divisors ✅

Wheat Stone Bridge ✅

Company Name: Rubrik
Role: Software Engineer (Winter Intern)

Batch eligible: 2025 grads only
Apply: https://www.rubrik.com/company/careers/departments/job.6195381

Company Name: GFG
Role: MTS (DSA)

Eligibility: Only for 2024/ 2025 pass-outs
Location: Onsite (Noida Sector 136)
Duration: 6 months
Internship starting immediately.

If interested send your resume to: shreya.singh@geeksforgeeks.org

int findNetworkEndpoint(int start, const vector<int>& fromNodes, const vector<int>& toNodes) {
    if (fromNodes.size() <= 0 || toNodes.size() >= 10000) return 0;

    unordered_map<int, int> nodeMap;
    for (size_t i = 0; i < fromNodes.size(); ++i) {
        nodeMap[fromNodes[i]] = toNodes[i];
    }

    while (nodeMap.find(start) != nodeMap.end()) {
        start = nodeMap[start];
    }

    return start;
}

Apple ✅

def canReachLastStone(stones):
    lastP = len(stones) - 1
    for i in range(lastP, -1, -1):
        if i + stones[i] >= lastP:
            lastP = i
    return 1 if lastP == 0 else 0

Can reach Last stones
Apple ✅

#include <bits/stdc++.h>

using namespace std;

void solve(vector<int> &curr, int L, int R, int &fm, int &sm) {
    fm = INT_MIN;
    sm = INT_MIN;

    for (int i = L; i <= R; ++i) {
        if (curr[i] > fm) {
            sm = fm;
            fm = curr[i];
        } else if (curr[i] > sm) {
            sm = curr[i];
        }
    }
}

int main() {
    int N, Q;
    cin >> N;

    vector<int> curr(N + 1);
    for (int i = 1; i <= N; ++i) {
        cin >> curr[i];
    }

    cin >> Q;

    for (int q = 0; q < Q; ++q) {
        int L, R;
        cin >> L >> R;

        int fm, sm;
        solve(curr, L, R, fm, sm);
        int ans = (fm + sm) / 2;

        cout << ans << endl;
    }

    return 0;
}

Globallogic ✅