๐ZOHO Hiring Software Developer | Batch: 2018-2022
*Job Role:Software Developer
*Education:Any Graduate
*Batch:2018, 2019, 2020, 2021, 2022
*Last Date:ASAP
*Experience:Fresher To 4 Year's
*Job Location:Chennai, India
*Salary:4 LPA+
https://fresherearth.blogspot.com/2022/03/ZOHO-Hiring-Software-Developer-Batch-2018-2022.html
โ Share with your friends
*Job Role:Software Developer
*Education:Any Graduate
*Batch:2018, 2019, 2020, 2021, 2022
*Last Date:ASAP
*Experience:Fresher To 4 Year's
*Job Location:Chennai, India
*Salary:4 LPA+
https://fresherearth.blogspot.com/2022/03/ZOHO-Hiring-Software-Developer-Batch-2018-2022.html
โ Share with your friends
FresherEarth - Get All Latest Jobs Here
ZOHO Hiring Software Developer | Batch: 2018-2022
fresher jobs, freshers jobs, off campus jobs, latest fresher jobs, fresher jobs bangalore, fresher jobs hyderabad, latest walk in drive
๐1
๐ Infosys Off Campus Drive | Systems Engineer | 3.6 LPA
* Job Role : Systems Engineer
* Education : BE/BTech/ME/MTech/MCA/MSc
* Batch : 2019/2020/2021/2022
* CTC : 3.6 LPA
https://fresherearth.blogspot.com/2022/03/Infosys-Off-Campus-Drive-Systems-Engineer-3.6-LPA.html
* Job Role : Systems Engineer
* Education : BE/BTech/ME/MTech/MCA/MSc
* Batch : 2019/2020/2021/2022
* CTC : 3.6 LPA
https://fresherearth.blogspot.com/2022/03/Infosys-Off-Campus-Drive-Systems-Engineer-3.6-LPA.html
FresherEarth - Get All Latest Jobs Here
Infosys Off Campus Drive | Systems Engineer | 3.6 LPA
fresher jobs, freshers jobs, off campus jobs, latest fresher jobs, fresher jobs bangalore, fresher jobs hyderabad, latest walk in drive
TCS IRA Answers โ
4)b
The table was served
5)c
I like the
6)d
All the above
9)c
Traditional
10)b
Veracity
11)b
0 to 54
36)b
37)d
38)b
39)b
40)a
35)b
Select *from bags brand ;
33)a
The statement will fail
31)a
Update bags price
49)error
47) b
23)b
24)c
25)d
14) a
15)a
16)c
4)b
The table was served
5)c
I like the
6)d
All the above
9)c
Traditional
10)b
Veracity
11)b
0 to 54
36)b
37)d
38)b
39)b
40)a
35)b
Select *from bags brand ;
33)a
The statement will fail
31)a
Update bags price
49)error
47) b
23)b
24)c
25)d
14) a
15)a
16)c
โ ๏ธ Share post in ur college and telegram Group's
JAVA IRA โ
1.TRUE
2.COST EFFECTIVNESS
5.NATIVE APPLICATION
8.PAUL CAN BE TASK ORIENTED
35.C
36.D
37.NUMBER 5 (B).
39.222
40.STATIC
41.THREE OBJECTS
1.TRUE
2.COST EFFECTIVNESS
5.NATIVE APPLICATION
8.PAUL CAN BE TASK ORIENTED
35.C
36.D
37.NUMBER 5 (B).
39.222
40.STATIC
41.THREE OBJECTS
Gartner Associate Software Engineer for 2022 batch!
https://gartner.wd5.myworkdayjobs.com/en-US/EXT/job/Gurgaon/Associate-Software-Engineer_65554?source=JB-10120&source=JB-10120
https://gartner.wd5.myworkdayjobs.com/en-US/EXT/job/Gurgaon/Associate-Software-Engineer_65554?source=JB-10120&source=JB-10120
class Items:
def init(self,itemId,itemName,itemPrice,itemTotq):
self.itemId=itemId
self.itemName=itemName
self.itemPrice=itemPrice
self.itemTotq=itemTotq
class ItemManagementSystem:
def init(self,L1,comp):
self.comp=comp
def itemWithMaxQuantity(self):
L=[]
d={}
for k in L1:
L.append(k.itemTotq)
for k in L1:
if k.itemTotq==max(L):
d[k.itemName]=[k.itemId,k.itemName,k.itemPrice]
d=dict(sorted(d.items(),key=lambda x:x[0],reverse=True))
for k in d:
print(*d[k])
def findStockAvaliable(self):
c=0
for k in L1:
if k.itemTotq>=comp:
print(k.itemId)
c+=1
if c==0:
print("Item not found")
L1=[]
for _ in range(5):
itemId=int(input())
itemName=input()
itemPrice=int(input())
itemTotq=int(input())
L1.append(Items(itemId,itemName,itemPrice,itemTotq))
comp=int(input())
obj=ItemManagementSystem(L1,comp)
obj.itemWithMaxQuantity()
obj.findStockAvaliable()
Python PRAโ
def init(self,itemId,itemName,itemPrice,itemTotq):
self.itemId=itemId
self.itemName=itemName
self.itemPrice=itemPrice
self.itemTotq=itemTotq
class ItemManagementSystem:
def init(self,L1,comp):
self.comp=comp
def itemWithMaxQuantity(self):
L=[]
d={}
for k in L1:
L.append(k.itemTotq)
for k in L1:
if k.itemTotq==max(L):
d[k.itemName]=[k.itemId,k.itemName,k.itemPrice]
d=dict(sorted(d.items(),key=lambda x:x[0],reverse=True))
for k in d:
print(*d[k])
def findStockAvaliable(self):
c=0
for k in L1:
if k.itemTotq>=comp:
print(k.itemId)
c+=1
if c==0:
print("Item not found")
L1=[]
for _ in range(5):
itemId=int(input())
itemName=input()
itemPrice=int(input())
itemTotq=int(input())
L1.append(Items(itemId,itemName,itemPrice,itemTotq))
comp=int(input())
obj=ItemManagementSystem(L1,comp)
obj.itemWithMaxQuantity()
obj.findStockAvaliable()
Python PRAโ
๐Accenture Associate Software Engineer Hiring | 4.5 LPA
Job Role: Associate Software Engineer
Qualification: BE/BTech/BCA/B.Com/BSc/BBA/BA
Year Of Passing: 2019/2020/2021/2022
Experience: Freshers
Location : Bangalore, Hyderabad, Chennai, Pune
Salary : 4.5 LPA
https://fresherearth.blogspot.com/2022/03/Accenture-Associate-Software-Engineer-Hiring-4.5-LPA.html
Job Role: Associate Software Engineer
Qualification: BE/BTech/BCA/B.Com/BSc/BBA/BA
Year Of Passing: 2019/2020/2021/2022
Experience: Freshers
Location : Bangalore, Hyderabad, Chennai, Pune
Salary : 4.5 LPA
https://fresherearth.blogspot.com/2022/03/Accenture-Associate-Software-Engineer-Hiring-4.5-LPA.html
FresherEarth - Get All Latest Jobs Here
Accenture Associate Software Engineer Hiring | 4.5 LPA
fresher jobs, freshers jobs, off campus jobs, latest fresher jobs, fresher jobs bangalore, fresher jobs hyderabad, latest walk in drive
โ
โ
โ
#HackerRank Paths in a Warehouse - HackerRank Python Solution
def numPaths(warehouse):
paths = [[0]*len(warehouse[0]) for i in warehouse]
if warehouse[0][0] == 1:
paths[0][0] = 1
for i in range(1, len(warehouse)):
if warehouse[i][0] == 1:
paths[i][0] = paths[i-1][0]
for j in range(1, len(warehouse[0])):
if warehouse[0][j] == 1:
paths[0][j] = paths[0][j-1]
for i in range(1, len(warehouse)):
for j in range(1, len(warehouse[0])):
if warehouse[i][j] == 1:
paths[i][j] = paths[i-1][j] + paths[i][j-1]
return paths[-1][-1]%(10**9+7)
warehouse = [[1,1,1,1], [1,1,1,1],[1,1,1,1]]
print(numPaths(warehouse))
def numPaths(warehouse):
paths = [[0]*len(warehouse[0]) for i in warehouse]
if warehouse[0][0] == 1:
paths[0][0] = 1
for i in range(1, len(warehouse)):
if warehouse[i][0] == 1:
paths[i][0] = paths[i-1][0]
for j in range(1, len(warehouse[0])):
if warehouse[0][j] == 1:
paths[0][j] = paths[0][j-1]
for i in range(1, len(warehouse)):
for j in range(1, len(warehouse[0])):
if warehouse[i][j] == 1:
paths[i][j] = paths[i-1][j] + paths[i][j-1]
return paths[-1][-1]%(10**9+7)
warehouse = [[1,1,1,1], [1,1,1,1],[1,1,1,1]]
print(numPaths(warehouse))
IDFC first Bank campus challenge
15 LPA ๐ฅ
Eligibility Criteria:
Years of experience: Open for Batch of 2020 / 2021 and 2022.
https://assessment.hackerearth.com/challenges/hiring/idfc-first-bank-private-campus-challenge/?utm_source=TechProgramMind&utm_medium=Youtube&utm_campaign=25March&utm_term=IntegratedVideo
15 LPA ๐ฅ
Eligibility Criteria:
Years of experience: Open for Batch of 2020 / 2021 and 2022.
https://assessment.hackerearth.com/challenges/hiring/idfc-first-bank-private-campus-challenge/?utm_source=TechProgramMind&utm_medium=Youtube&utm_campaign=25March&utm_term=IntegratedVideo
HackerEarth
IDFC FIRST Bank_Campus Challenge
This Hackathon will focus on your ability to understand business challenges and come up with innovative solutions. We are looking for Application Engineers to join our Technology Team at IDFC FIRST Bank. In addition to the challenge, we will also throw openโฆ
๐TCS Digital Hiring for 2022 Batch with Salary : 7 Lakhs/Year
* Job Role : TCS Digital
* Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
Experience : Freshers
* Salary : 7.0 LPA (UG) & 7.3 LPA (PG)
https://fresherearth.blogspot.com/2022/03/TCS-Digital-Hiring-for-2022-Batch-with-Salary-7-LakhsYear-TCS-Off-campus-Recruitment-Drive-2022.html
โ Share with your friends
* Job Role : TCS Digital
* Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
Experience : Freshers
* Salary : 7.0 LPA (UG) & 7.3 LPA (PG)
https://fresherearth.blogspot.com/2022/03/TCS-Digital-Hiring-for-2022-Batch-with-Salary-7-LakhsYear-TCS-Off-campus-Recruitment-Drive-2022.html
โ Share with your friends
FresherEarth - Get All Latest Jobs Here
TCS Digital Hiring for 2022 Batch with Salary : 7 Lakhs/Year | TCS Off campus Recruitment Drive 2022
fresher jobs, freshers jobs, off campus jobs, latest fresher jobs, fresher jobs bangalore, fresher jobs hyderabad, latest walk in drive
๐1
Amazon SDE Challenge - April/ May 2022
SDE 1 and SDE 2
Experience: 1 years+
Compensation: Best in industry
Job Location: Bangalore, Delhi, & Hyderabad
https://assessment.hackerearth.com/challenges/hiring/amazon-software-development-engineer-challenge/?utm_source=email&utm_medium=registration&utm_campaign=AmazonSDEChallengeAprilMay2022
SDE 1 and SDE 2
Experience: 1 years+
Compensation: Best in industry
Job Location: Bangalore, Delhi, & Hyderabad
https://assessment.hackerearth.com/challenges/hiring/amazon-software-development-engineer-challenge/?utm_source=email&utm_medium=registration&utm_campaign=AmazonSDEChallengeAprilMay2022
HackerEarth
Amazon SDE Challenge - April/ May 2022
All shortlisted candidate profiles have been shared with the Amazon team, and they will contact candidates as per Scores and job fit.
Do you want to build products used every single day by your friends and family? Are you passionate about building productsโฆ
Do you want to build products used every single day by your friends and family? Are you passionate about building productsโฆ
๐ Infosys Off Campus Drive | Digital Hiring | 9.5 LPA
* Job Role : Specialist Programmer(9.5 LPA) & Digital Specialist Engineer (6.25 LPA)
* Education : BE, B.Tech, ME, M.Tech, MCA, MSc
* Branch : All Branches Eligible
* Batch : 2019, 2020, 2021, 2022
* CTC : 6.25 LPA To 9.5 LPA
https://fresherearth.blogspot.com/2022/03/Infosys-Off-Campus-Drive-Digital-Hiring-9.5-LPA.html
โ Share with your friends
* Job Role : Specialist Programmer(9.5 LPA) & Digital Specialist Engineer (6.25 LPA)
* Education : BE, B.Tech, ME, M.Tech, MCA, MSc
* Branch : All Branches Eligible
* Batch : 2019, 2020, 2021, 2022
* CTC : 6.25 LPA To 9.5 LPA
https://fresherearth.blogspot.com/2022/03/Infosys-Off-Campus-Drive-Digital-Hiring-9.5-LPA.html
โ Share with your friends
๐ WIPRO INTERVIEW EXPERIENCE (IT) :
Intro
How to handle team members complaint conflict
How to handle clients complain
Relocation
Bond
How do handle disagreement with higher authority
How to handle your mistake
Any questions
Why Wipro
Intro
How to handle team members complaint conflict
How to handle clients complain
Relocation
Bond
How do handle disagreement with higher authority
How to handle your mistake
Any questions
Why Wipro
๐ IBM Recruitment 2022 : Hiring Freshers as Associate Systems Engineer With 4.2 LPA
* Job Role : Associate Systems Engineer
* Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
* Batch : 2019/2020/2021/2022
* Salary : upto Rs 4.2 LPA
https://fresherearth.blogspot.com/2022/03/IBM-Recruitment-2022-Hiring-Freshers-as-Associate-Systems-Engineer-With-4.2-LPA.html
โ Share with your friends
* Job Role : Associate Systems Engineer
* Qualification : B.E/B.Tech/M.E/M.Tech/MCA/M.Sc
* Batch : 2019/2020/2021/2022
* Salary : upto Rs 4.2 LPA
https://fresherearth.blogspot.com/2022/03/IBM-Recruitment-2022-Hiring-Freshers-as-Associate-Systems-Engineer-With-4.2-LPA.html
โ Share with your friends
๐1
๐ WIPRO INTERVIEW EXPERIENCE (CSE) :
Introduction
Why Wipro
Team management questions
Leadership Abilities
Social works
Family Background
Explain Project
What technology you use currently
Internship technical role
Different b/w C C++
Pointer
What is JVM JRE JDK
What is Inheritance
and Oops questions
ready to sign bond
Introduction
Why Wipro
Team management questions
Leadership Abilities
Social works
Family Background
Explain Project
What technology you use currently
Internship technical role
Different b/w C C++
Pointer
What is JVM JRE JDK
What is Inheritance
and Oops questions
ready to sign bond
๐2
โ
โ
โ
#HackerEarth Call duration - SQL Questions - HackEarth Solutions
โ
โ
โ
#HackerEarth The Abandoned City - C++ Solution
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin>>n;
ll arr[100005];
for(ll i=1;i<=n;i++){
cin>>arr[i];
}
ll k;
cin>>k;
ll pre[100005];
pre[0]=0;
for(ll i=1;i<=n;i++){
pre[i] = pre[i-1]+arr[i];
}
if(pre[n]<k){
cout<<-1<<"\n";
}
else{
ll ans = INT_MAX;
for(ll i=1;i<=n;i++){
ll l=i;
ll r=n;
ll mid;
while(l<=r){
//cout<<l<<" "<<r<<"\n";
mid = (l+r)/2;
if(pre[mid]-pre[i-1]>=k){
//cout<<mid<<"\n";
ans = min(ans,mid-i+1);
r=mid-1;
}
else
l=mid+1;
}
}
cout<<ans<<"\n";
}
return 0;
}