🎯CODENATION OFF CAMPUS DRIVE

Role: Software Development Engineer
Eligibility: B.E/B.Tech, MCA
Batch:2021
CTC: 29.5 Lakh Per Annum

📌LINK:https://bit.ly/3xg6e3i

Telegram: @fresherearth

🔔 Hexaview Off Campus Drive 2021 | Freshers | Application Engineer | BE/ B.Tech/ ME/ M.Tech | Pune/ Noida | 4-6 LPA

* Job Role : Application Developer/ Member of Technical Staff
* Qualification : B.E/B.Tech
* Experience : Freshers (2020, 2021 Batch)
* Job Location : Pune, Noida
* Package : 4-6 LPA

https://fresherearth.blogspot.com/2021/06/hexaview-off-campus-drive-2021-freshers.html

✅📪 @fresherearth ✅

🎯PUBLIC SAPIENT OFF CAMPUS DRIVE

Batch: 2021/22
Eligibility: BE/B. TECH

Registration Deadline: 13 Jul

📌Link: https://dare2compete.com/o/jumpstart-publicis-sapient-181479?lb=21070317#tab-dates

Telegram: @fresherearth

Siemens coding answer

#include<stdio.h>
#include<string.h>
#include<map>
#include<algorithm>
#define ll long long
using namespace std;
map<ll,ll>mp[30][30];
int n,m,t;
ll k,num[30][30],ans;
// double-ended dfs, one from (1,1) to (i,j) and i+j==max(n,m)

void dfs1(int x,int y,ll tt)
{
if(x+y==t)
{
Mp[x][y][tt]++; //Use the map to record the number of tt when searching for points (y, x)
return ;
}
if(x+1<=n)
dfs1(x+1,y,tt^num[x+1][y]);
if(y+1<=m)
dfs1(x,y+1,tt^num[x][y+1]);
}
// second from (n,m) to (i,j) and (i+j)==max(n,m)+1
void dfs2(int x,int y,ll tt)
{
if(x+y==t+1)
{
if(x-1>=1)
ans+=mp[x-1][y][tt^k];
if(y-1>=1)
ans+=mp[x][y-1][tt^k];
return ;
}
if(x-1>=1)
dfs2(x-1,y,tt^num[x-1][y]);
if(y-1>=1)
dfs2(x,y-1,tt^num[x][y-1]);
}
int main()
{
while(~scanf("%d%d%lld",&n,&m,&k))
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
mp[i][j].clear();
scanf("%lld",&num[i][j]);
}
}
ans=0;
t=max(n,m);
if(1+1<=t)
{
dfs1(1,1,num[1][1]);
dfs2(n,m,num[n][m]);
}
else
{
if(num[1][1]==k)
ans++;
}
printf("%lld\n",ans);
}
}

XoR paths





int solve (int n, int m, vector<int> v) {
long long l = 1, r = *max_element(v.begin(), v.end()), mid, cnt;
while(l<r){
mid = (l+r)/2;
cnt = 0;
for(auto& i: v) cnt += ceil(1.0*i/mid);
if(cnt>n) l = mid+1;
else r = mid;
}
return l;
}

Seimens vaccination distribution code

Reverse the string with spaces

For checking number is power of two or not
Python

Ig infotech

🔔 Sopra Banking Software Off Campus Drive 2021 | BE/B.Tech | Software Engineer Trainee | Noida | 3 LPA+

* Job Title : Software Engineer Trainee
* Office Location : Noida
* Qualification : BE/B.Tech
* Batch : 2021
* Salary : 3 LPA+

https://fresherearth.blogspot.com/2021/07/sopra-banking-software-off-campus-drive.html

✅📪 @fresherearth ✅

🔔 Capgemini Engineering Off Campus Drive 2021 | Freshers | Across India

* Job Role : Network Engineer Trainee
* Qualification : B.Tech/B.E./BCA/MCA/BSc/MSc
* Batch : 2019/2020 Batch (No Active Backlogs)
* Experience : Freshers
* Job Location : PAN India

Network Trainee: https://app.talentrank.in/a/rt/1683
Code: 86817371
Apply-Link For Network Engineer : https://app.talentrank.in/a/rt/1668
Code: 36397349

✅📪 @fresherearth ✅

Ericsson Hiring Freshers

jobs.ericsson.com/job/Bangalore-Graduate-Engineer-Trainee-Fresher-KA/730643602

Telegram - @fresherearth

CTS== COGNIZANT

Advanced
Only FOR CSE BRANCH

Batch 2021
AFTER APPLYING WITHIN 5 u get assignment link also 👍

60% throughout


@sup777exams
https://recruit.hirebridge.com/v3/careercenter/v2/details.aspx?jid=552242&cid=7574&locvalue=1044&
@f_a_a_n_g_777

🔔 Tata Elxsi Off Campus Drive 2021 – Hiring Freshers of BE , B.Tech, M.Tech, MCA | Apply Online

* Qualification : BE/B.Tech/ME/M.Tech/MCA
* Batch : 2021
* Drive Location : Virtual ( Online from Home)
* Drive Date / Test Date : 14- 16 July 2021
* Last Date to Apply : 08 July 2021

https://fresherearth.blogspot.com/2021/07/tata-elxsi-off-campus-drive-2021-hiring.html

✅📪 @fresherearth ✅

Zoho Hiring Full Stack Java Developers | 2017 - 2021 Batch

bit.ly/3hhlrf2

Telegram - @fresherearth