📌 Nissan is Hiring !!

Role: Software Engineer I
Qualification: Bachelor's
Freshers can apply
Batch: 2024

Apply:
https://alliance.wd3.myworkdayjobs.com/en-US/nissanjobs/job/software-engineer-i_r00151957-1

Company Name: Walmart

Role: Software Engineer Intern

Batch eligible: 2024 passouts

Apply: https://bit.ly/3R3D5mO

#include<bits/stdc++.h>
#define fastread()  (ios_base:: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL));
#define pb(x) push_back(x)
#define all(x) x.begin(),x.end()
#define test(x)  int x; cin>>x; while(x--)
#define int long long int
#define print(a,n) for(int i=0;i<n;i++) cout<<a[i]<<" ";
#define input(a,n) for(int i=0;i<n;i++) cin>>a[i];
int M= 1e9+7;
#define endl "\n"
int ncr(int n,int r){ int res=1; if(r>n-r)r=n-r; for(int i=0;i<r;i++) {  res*=n-i;  res/=i+1; } return res; }
//int f(int n)  {if (n >= M) return 0;int result = 1; for (int i = 1; i <= n; i++) result = (result * i) % M;return result;}

using namespace std;

int dx[] = { 0,1,0,-1, -1, 1, 1, -1};
int dy[] = {-1,0,1,0,   1, 1, -1, -1};

int dfs(int node, vector<vector<int>> &adj, vector<bool> &vis, vector<bool> &corrupt)
{
    queue<int> q;
    int mini =  INT_MAX;
    q.push(node);
 
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        if(x !=node && !corrupt[x])
            mini = min(mini, x);
        for(auto it : adj[x])
        {
          if(!vis[it])
             {
                q.push(it);
                vis[it] = true;
            }
        }
    }
    return mini == INT_MAX? -1: mini;

}
int solve()
{
    int nodes, edges;
    cin >> nodes >> edges;
    int n =  nodes;
    int temp1;
    cin >>  temp1;
    vector<bool> vis(n + 1, false);
    vector<vector<int>> adj(n + 1);
    for(int i = 0;i < edges;i++)
    {
        int p, q;
        cin >> p >> q;
        adj[p].push_back(q);
        adj[q].push_back(p);

    }


    int q;
    cin >> q;
    int temp;
    cin >> temp;

    vector<int> ans;
    vector<bool> corrupt(n + 1, false);
    while(q--)
    {
        int x, y;
        cin >> x >> y;

        if(x  ==  1)
        {
           vector<bool> vis(n + 1, false);
           int mini = y;
           if(corrupt[y])
             {
                mini =  dfs(y, adj, vis, corrupt);
            }
         
           ans.push_back(mini);
        }

        else
            corrupt[y] = true;
    }

    for(int i = 0; i < ans.size();i++)
        cout << ans[i] << endl;
    return 0;
}



signed main() {
    solve();
    return 0;
}

UBS✅
Dead Pod Recovery

Oracle Hiring Intern

Batch : 2024, 2025 batch

Experience: Students

Salary :50k - 75k per mont ( Expected)

Application link  : https://eeho.fa.us2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/jobsearch/job/217181

The Trade Dask Hiring Summer Intern

Batch : 2024, 2025 passout

Experience: Students

Salary : 50k - 75k per month ( Expected)

Application link  : https://careers.thetradedesk.com/jobs/4150177007/2024-summer-internship-software-engineering-bangalore

Axiom Hiring Python Intern

Batch : 2024, 2025 passout

Location: Work from home

Duration: 3 month

Experience: fresher

Salary : 30k - 40k per month ( Expected)

https://www.axiommrc.com/careers/python-intern

JAVA Freshers Referrals!

https://www.linkedin.com/posts/pooja-katyal-206149140_hiring-javadevelopment-javadeveloper-activity-7135215357299933184-VyJh?utm_source=share&utm_medium=member_desktop

int solution(vector<string> &board)
{
  const size_t n = board.size();
  const size_t m = board[0].size();

  int res = 0;
    // Initialize a prefix sum array to store counts of 'A's and 'B's
    vector<vector<int>> prefixA(n + 1, vector<int>(m + 1, 0));
    vector<vector<int>> prefixB(n + 1, vector<int>(m + 1, 0));

    // Compute the prefix sums for 'A's and 'B's
    for (size_t i = 1; i <= n; ++i) {
        for (size_t j = 1; j <= m; ++j) {
            prefixA[i][j] = prefixA[i - 1][j] + prefixA[i][j - 1] - prefixA[i - 1][j - 1];
            prefixB[i][j] = prefixB[i - 1][j] + prefixB[i][j - 1] - prefixB[i - 1][j - 1];
            if (board[i - 1][j - 1] == 'A') {
                prefixA[i][j]++;
            } else if (board[i - 1][j - 1] == 'B') {
                prefixB[i][j]++;
            }

     if (prefixA[i][j] == prefixB[i][j]) res++;
        }
    }
    return res;
   
}

Python 3✅

vector<int> solve(int n, vector<string>& logs) {
    vector<int> eT(n, 0);
    stack<pair<int, int>> fS;

    for (const string& l : logs) {
        stringstream s(l);
        string t;
        vector<string> ts;
        while (getline(s, t, ':')) {
            ts.push_back(t);
        }

        int f = stoi(ts[0]);
        string a = ts[1];
        int tm = stoi(ts[2]);

        if (a == "start") {
            fS.push({f, tm});
        } else {
            int eTm = tm - fS.top().second + 1;
            eT[f] += eTm;
            fS.pop();

            if (!fS.empty()) {
                eT[fS.top().first] -= eTm;
            }
        }
    }

    return eT;
}

Co prime CPU ✅

long long g[1000001],f[1000001],res=0;
int n,k,m,l,r,c,p;
vector<pair<int,int> > v[1000001 +7];
void upd(int id,int num,long long money)
{
    for(int cin=id;cin<1000001;cin=cin+(cin&-cin))f[cin]+=num,g[cin]+=money;
}
long long get()
{
    int cur=0,tar=k;
    long long res=0;
    for(int cin=19;cin>=0;cin--)
    if(cur+(1<<cin)<1000001&&tar>f[cur+(1<<cin)])
    {
        tar-=f[cur+(1<<cin)];
        res+=g[cur+(1<<cin)];
        cur+=(1<<cin);

    }

    if(tar&&cur<1000001 -1)res+=1LL*(cur+1)*tar;

    return res;
}

int solution(int n, int k, const vector<vector<int>> &plans)
{
  for(int i = 0; i <= n; i++) v[i].clear();
  fill(g, g+n+1, 0);
  fill(f, f+n+1, 0);
  for (const auto &plan : plans) {
    int l = plans[0], r = plans[1], c = plans[2], p = plans[3];
        v[l].push_back(pair<int,int>(c,p));
        v[r+1].push_back(pair<int,int>(-c,p));
  }
  for(int i=1;i<=n;i++)
  {
        int sz=v[i].size();
        for(int j=0;j<sz;j=j+1)upd(v[i][j].second,v[i][j].first,1LL*v[i][j].first*v[i][j].second);
        res+=get();
  }
  return res; 
}

IBM ✅

Company Name: Coinbase

Role: Software Engineer Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://www.coinbase.com/careers/positions/5466500?gh_jid=5466500&gh_src=20687b321us

HireQuotient is looking for Frontend Interns

Duration: 3-6 months

Interested Candidates can feel this form: https://docs.google.com/forms/d/e/1FAIpQLSezUh37kB8_c7t0v4KOQFG49a6Lzxo-hfZTxaVoMHRLz3nADQ/viewform