Apply for this
Amazon
2021 passout only

If u survive till 4 round then

Try this

🧑‍💻🧑‍💻🧑‍💻🧑‍💻🧑‍💻

Hewlett Packard

🧑‍💻🧑‍💻🧑‍💻🧑‍💻🧑‍💻

@f_a_a_n_g_777
@sup777exams
Eligibility :

B.E/B.Tech/M.E/M.Tech in CS, IT or equivalent.

https://careers.hpe.com/job/Hewlett-Packard-Enterprise-Bangalore-Software-Engineer-Karnataka/155283025#need-to-knowg

Nagarro Hiring Trainee

Register asap

🔔 Cloudera Off Campus Drive 2021: Desktop Support Technician | 0-2 years | BE/ B.Tech/ BS | Bangalore

* Job Role : Desktop Support Technician
* Experience : Freshers
* Job Location : Bangalore
* Batch : (2019 to 2021 Batch)
* Package : 2.8 LPA+

https://fresherearth.blogspot.com/2021/06/cloudera-off-campus-drive-2021-desktop.html

✅📪 @fresherearth✅

*HP* is *Hiring*🔔

*Hewlett Packard* is hiring for the profile for *Software Engineer*🤓

*Eligibility* :

📌 B.E/B.Tech/M.E/M.Tech in CS, IT or equivalent.

📌 0 - 2 years of experience

*Apply* and know more 👇:

https://careers.hpe.com/job/Hewlett-Packard-Enterprise-Bangalore-Software-Engineer-Karnataka/155283025#need-to-know

*CTC* : 8 LPA

🔔 ZenQ Hiring Software Developer | EXP: 0 – 1 year | Online Test | 2.5 LPA

* Job Role : Software Developer
* Qualification : B.E/B.Tech
* Experience : 0 – 1 years
* Job Location : Hyderabad, IN
* Package : 2.52 LPA

https://fresherearth.blogspot.com/2021/06/zenq-hiring-software-developer-exp-0-1.html

✅📪 @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 ✅

MetricStream Off Campus Drive | 2021 Batch | 6LPA

https://bit.ly/3qwSHBU

Telegram - @fresherearth

Altimetrik

Batch 2021/2020

Branch Check it
@sup777exams

@f_a_a_n_g_777

https://info.altimetrik.com/ncghiring

@mrt_R777
Bro
TODAY WE CROSSED
1K
😍30/06/2021😍

Juspay Solutions:

--1st o/0(11)

def traverse(graph, visited, curr, path, stack, n):
if curr==n-1:
path.append(stack.copy())
stack.pop()
return path, stack
else:
visited[curr] = 1
for ele in graph[curr]:
if visited[ele] == 0:
stack.append(ele)
path, stack = traverse(graph, visited, ele, path, stack, n)
stack.pop()
return path, stack

n, m, t, c = map(int, input().split())

graph = [[] for _ in range(n)]
visited = [0 for _ in range(n)]

for _ in range(m):
a,b = map(int, input().split())
graph[a-1].append(b-1)
graph[b-1].append(a-1)

path, _ = traverse(graph, visited, 0, [], [0], n)

path.sort(key=lambda x:len(x))

# print(path)

tim = 0
l = len(path[0])
for i in range(1, l):
tim += c
if i==l-1:
break
else:
temp = tim//t
if temp%2==1:
tim = (temp+1)*t

print(tim)



2nd--o/p(11011)

#include<bits/stdc++.h>
using namespace std;
#define ll long long int

vector<int> store[1001];
vector<pair<ll,vector<ll>>> ptr;

void dfs(ll st,ll e,ll vis[],vector<ll> rs,ll w){
rs.push_back(st);
if(st == e){
ptr.push_back({w*(rs.size()-1),rs});
return;
}
for(auto u : store[st]){
if(vis[u] == 0){
vis[st] = 1;
dfs(u,e,vis,rs,w);
vis[st] = 0;
}
}
}

int main()
{
ll n,m,t,c,u,v;
cin>>n>>m>>t>>c;
while(m--){
cin>>u>>v;
store[u].push_back(v);
store[v].push_back(u);
}
vector<ll> rs;
ll w = c;
ll vis[n+1] = {0};
dfs(1,n,vis,rs,w);
sort(ptr.begin(),ptr.end());
vector<ll> rt[n+1];
for(int i=0;i<ptr.size();i++){
ll nes = ptr[i].second.size();
for(auto u : ptr[i].second){
rt[u].push_back(nes);
}
}
ll trt[n+1] = {0};
trt[1] = 1;
trt[n] = 1;
for(int i=2;i<=n-1;i++){
if(rt[i].size() > 0){
ll tm = rt[i][0];
ll up = upper_bound(rt[i].begin(),rt[i].end(),tm) - rt[i].begin();
trt[i] = up;
}
}
for(int i=1;i<=n;i++)
cout<<trt[i]<<" ";
return 0;
}


3rd--o/p(-1)

def fun(arr,s,en,length,char,t,ans,final,green,ch):
if ans//t>ch:
green=not green
ch+=1
if s==en:
final.append(ans)
return
for i in arr[s]:
if str(i) not in length[:-1].split():
if green:
fun(arr,i,en,length+str(i)+" ",char,t,ans+char,final,green,ch)
else:
aq=ans%t
fun(arr,i,en,length+str(i)+" ",char,t,ans+char+t-aq,final,not green,ch)
return

n,m,t,c=map(int,input().split())
d={}
for i in range(m):
u,v=map(int,input().split())
if u in d:
d[u].append(v)
else:
d[u]=[v]
if v in d:
d[v].append(u)
else:
d[v]=[u]
l="1 "
final=[]
green=True
ch=0
ret=fun(d,1,n,l,c,t,0,final,green,ch)
final=set(final)
final=list(final)
final.sort()
if len(final)>1:
print(final[1])
else:
print(-1)




Juspay

For 1st ques
O/p 11(Python3)
All test case passing
For 2nd ques
O/p 11011(c++)
7/10
For 3rd ques (Python3)
O/p -1
8/10

Only change variables if someone writing now onward

Because all copying this code only