Company Name: Happyfox
Role: Backend Developer Intern
Batch Eligible: 2025 passouts
Location: Bangalore

PPO Based on Performance

Share with your College Whatsapp Groups & Friends too

Apply Link: https://happyfox.hire.trakstar.com/jobs/fk0pq6x/

Note: Apply ASAP! It can get closed anytime soon.

Nordson hiring Software Engineer

0-1 year experience
3-5 LPA CTC

Apply Here : https://nordsonhcm.wd5.myworkdayjobs.com/nordsoncareers/job/India---Bangalore/Software-Engineer-I_REQ42193?source=LinkedIn

https://docs.google.com/forms/d/e/1FAIpQLSfbtl-y8b9JJ3f1TFrEOl-lSsZK9OipWMRlZEZL_OWSVeI-_Q/viewform

2025 batch

Form Link: https://forms.gle/MGmwCqJxVhHyjUXe6

🔗 Post Link: https://www.linkedin.com/posts/crtd-technologies_crtdtechnologies-fullstackdeveloper-hiringnow-activity-7265405654419300352-_6JB

https://www.linkedin.com/posts/ayushi-jain-99383914b_google-forms-sign-in-activity-7265272392694796288-A7tT?utm_source=share&utm_medium=member_desktop

2026 and 2027

https://ess.pockethrms.com/Recruitment/Recruitment/JobDetail?schema=thlh49UPbDG6oQN3nVlOsQ==&company=74nptQxi3x8gf4Sn3roRfQ==&Id=tuKeo9qBBGsYf/7RjctyUw==

2025 only

📌Qualcomm is hiring Campus Engineer

For 2025 gards
Location: Hyderabad

💻Apply Here :
https://careers.qualcomm.com/careers/job/446700567694-2025-campus-hire-engineer-sw-hyderabad-telangana-india?domain=qualcomm.com

American Express :

Batch : 2025/26/27/28 passouts

Tech Roles for Campus : https://amex.co1.qualtrics.com/jfe/form/SV_emrLmvr2CmtPMrQ

Non - Tech roles for Campus students : https://amex.co1.qualtrics.com/jfe/form/SV_9TZvbpMXv8DIT5k

GenAI Meet up Alert 🚨

Venue - Microsoft, Bengaluru 💫

Here's the link 🔗
https://linkedin.openinapp.co/fd0v8

Awesome learning opportunity and build a network 📡

int digitSum(int x) {
    int sum = 0;
    while (x > 0) {
        sum += x % 10;
        x /= 10;
    }
    return sum;
}

vector<int> nextGreaterMultiverse(const vector<int>& arr) {
    int n = arr.size();
    vector<int> result(n, -1);
    stack<int> st;

    for (int i = n - 1; i >= 0; --i) {
        int currentDigitSum = digitSum(arr[i]);

        while (!st.empty()) {
            int topIdx = st.top();
            int topDigitSum = digitSum(arr[topIdx]);
           
            if (topDigitSum > currentDigitSum ||
               (topDigitSum == currentDigitSum && arr[topIdx] > arr[i])) {
                break;
            }
            st.pop();
        }

        if (!st.empty()) {
            result[i] = arr[st.top()];
        }

        st.push(i);
    }
   
    return result;
} 

Next maximum✅

#include<bits/stdc++.h>
#define ll long long int
using namespace std;
bool prime[100005];
int dp[100005];
ll answer;
bool visited[100005];
vector<int>adjacent[100005];

void dfs1(int u)
{
    visited[u] = true;
    int sum = prime[u] ? 0 : 1;
    for(int i = 0 ; i < adjacent[u].size() ; i++)
    {
        int v = adjacent[u][i];

        if(!visited[v])
        {
            dfs1(v);
            sum += dp[v];
        }
    }

    dp[u] = sum;

    if(prime[u]) dp[u] = 0;
}

void dfs2(int u, int p, int dv)
{
    visited[u] = true;

    if(prime[u])
    {
        vector<ll>pp;
        ll sum = dv;
        pp.push_back(dv);
        for(int i = 0 ; i < adjacent[u].size() ; i++)
        {
            int v = adjacent[u][i];

            if(!visited[v] && v != p)
            {
                dfs2(v, u, 0);
                pp.push_back(dp[v]);
                sum += dp[v];
            }
        }

        ll val = 0;
        for(int i = 0 ; i < pp.size() ; i++)
        {
            val += (sum-pp[i])*pp[i];
        }

        val /= 2;
        answer += val;
        answer += sum;
    }
    else
    {
        for(int i = 0 ; i < adjacent[u].size() ; i++)
        {
            int v = adjacent[u][i];

            if(!visited[v] && v != p)
            {
                dfs2(v, u, dv + dp[u] - dp[v]);
            }
        }
    }
}

void Sieve()
{
    for(int i = 1 ; i <= 100000 ; i++)
    {
        prime[i] = true;
    }

    prime[1] = false;

    for(int i = 2 ; i*i <= 100000 ; i++)
    {
        if(prime[i])
        {
            for(int j = i*i ; j <= 100000 ; j += i)
            {
                prime[j] = false;
            }
        }
    }
}

int main(){

    Sieve();

    int n;
    cin>>n;
    assert(1 <= n && n <= 100000);

    for(int i = 0 ; i < n - 1 ; i++)
    {
        int u,v;
        cin>>u>>v;
      assert(1 <= u && u <= n);
      assert(1 <= v && v <= n);

        adjacent[u].push_back(v);
        adjacent[v].push_back(u);
    }

    dfs1(1);
    for(int i = 1 ; i <= n ; i++) visited[i] = false;

    dfs2(1,0,0);

    cout<<answer<<endl;

}

prime pairs✅

Coinswitch is hiring SDE Intern (Apply Fast!)

For 2025 grads

https://recruiterflow.com/coinswitch/jobs/496

Company: Zenskar
Role: AI Engineering Intern
Remote

Apply: https://wellfound.com/jobs/3150781-ai-engineering-intern

https://surveys.infosysapps.com/r/a/SPCampusregistration_NATCOLLEGES25batch

Company:-Infosys
Package:- 9.5 lpa
Role:- SP
Good opportunity ✅ ✔️
Apply assap ✅ ✔️
Batches:-2023/2024/2025

Today anyone give exam Visa /Google just React