⚠️ Reminder - who didn't apply yet

IBM - t.me/fresherearth/2492
Replicon - t.me/fresherearth/2494
Infosys - t.me/fresherearth/2496
Hexaware - t.me/fresherearth/2498
ColorTokens - t.me/fresherearth/2500
Reliance Industries - t.me/fresherearth/2502
GlobalLogic - t.me/fresherearth/2504
AstraZeneca - t.me/fresherearth/2507

✅ Share in ur College WhatsApp Groups
📌Direct & 100% Ads Free Links
Telegram - t.me/fresherearth

Infosys 3pm slot answers
Q1) if a means
23
Q2)C
111
Q3)76
B

Q4) which two signs
D
++

D
÷+

Set 4 (Infosys 3Pm)

#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int>>adj[1000001];

int main(){
int n;
cin>>n;
unordered_map<int,int>mp;
for(int i=0;i<n;++i){
int x;
cin>>x;
mp[x]=INT_MAX;
}
int e;
cin>>e;
for(int i=0;i<e;++i){
int x,y,d;
cin>>x>>y>>d;
adj[x].push_back({y,d});
}
int src,dest;
cin>>src>>dest;
set<pair<int,int>>s;
mp[src]=0;
s.insert({0,src});
while(!s.empty()){
pair<int,int>tmp=*(s.begin());
s.erase(s.begin());
int u=tmp.second;
for(auto i=adj[u].begin();i!=adj[u].end();++i){
int v=(*i).first;
int weight=(*i).second;
if(mp[v]>mp[u]+weight){
if(mp[v]!=INT_MAX)
s.erase(s.find({mp[v],v}));
mp[v]=mp[u]+weight;
s.insert({mp[v],v});
}
}
}
if(mp[dest]==INT_MAX)
cout<<"-1"<<endl;
else
cout<<mp[dest]<<endl;
return 0;
}

Juspay (C++)✅

#include<bits/stdc++.h>
using namespace std;
vector<int>adj[1000001];
void solve(int src,int dest,unordered_map<int,int>&mp){
mp[src]=1;
for(int i=0;i<adj[src].size();++i){
if(!mp[adj[src][i]]){
solve(adj[src][i],dest,mp);
}
}
}

int main(){
int n;
cin>>n;
unordered_map<int,int>mp;
for(int i=0;i<n;++i){
int x;
cin>>x;
mp[x]=0;
}
int e;
cin>>e;

for(int i=0;i<e;++i){
int x,y;
cin>>x>>y;
adj[x].push_back(y);
}
int src,dest;
cin>>src>>dest;
solve(src,dest,mp);
cout<<mp[dest]<<endl;
return 0;
}

Juspay (C++)✅

void rearrange(int arr[], int n)
{
int temp[n];
int small = 0, large = n - 1;n
int flag = true;
for (int i = 0; i < n; i++) {
if (flag)
temp[i] = arr[large--];
else
temp[i] = arr[small++];

flag = !flag;
}
for (int i = 0; i < n; i++)
arr[i] = temp[i];
}

Alternate Prefix Sums ✅