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 ✅

Hi Guys Accenture link is still active . Please kindly apply ..

Those who are 2019 ,2020,21,22 ,23,24kindly use this opportunity

Eligibility Criteria:

Minimum criteria- Any engineering stream of B.E/B.Tech/M.E/MTech or MCA or MSc (CS/IT/Computer Applications/Data Science/Computer Science & Applications) - any year of pass out till 2024.

Apply link :: https://indiacampus.accenture.com/myzone/accenture/1/jobs/25377/job-details

Company Name: ADP
Role: Associate Software Engineer

Batch eligible: 2023 and 2024 grads

Apply: https://tech.adp.com/en/jobs/5001062748906/associate-software-engineer

Company Name: Eightfold
Role: Software Engineer
Batch eligible: 2024 grads only

Apply: https://employee.eightfold.ai/careers/job/68744096803?domain=volkscience.com

if(word1 == null || word2 == null){
   return (word1 == null && word2 == null) ? 1: -1;
  }
  if(word1.length() != word2.length()){
   return -1;
  }
  return (word1 + word1).contains(word2) ? 1 : -1;

Wells Fargo ✅

int countSquares(int arr[], int N)
{
    // Stores the count of array elements
    int count = 0;

    // Stores frequency of visited elements
    unordered_map<int, int> m;

    // Traverse the array
    for (int i = 0; i < N; i++) {
        m[arr[i]] = m[arr[i]] + 1;
    }

    for (int i = 0; i < N; i++) {

        // Square of the element
        int square = arr[i] * arr[i];

        // Update the count
        count += m[square];
    }

    // Print the count
    cout << count;
}

Wells Fargo ✅