Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Sifars is hiring for Software Developer.
Fresher's can apply,
Apply Link: https://www.linkedin.com/jobs/view/3514772594
Fresher's can apply,
Apply Link: https://www.linkedin.com/jobs/view/3514772594
Linkedin
Sifars hiring Software Developer - Fresher in India | LinkedIn
Posted 5:38:16 AM. Software Developer Fresher About Company:Sifars is seeking a talented individual who possessesโฆSee this and similar jobs on LinkedIn.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
AlgoZenith is hiring for Frontend Intern.
Batch eligible: 2023 and 2024 grads.
https://docs.google.com/forms/d/e/1FAIpQLSdfNE1s3DjlayPbAPUDNKPtQArbwI9bALHoG9yRenOTfR051w/viewform
Note: Experienced Candidates can also apply, just make sure you have knowledge of frontend.
Batch eligible: 2023 and 2024 grads.
https://docs.google.com/forms/d/e/1FAIpQLSdfNE1s3DjlayPbAPUDNKPtQArbwI9bALHoG9yRenOTfR051w/viewform
Note: Experienced Candidates can also apply, just make sure you have knowledge of frontend.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
bluCursor Infotech is hiring for Software Engineer role.
Batch eligible: 2020, 2021, 2022 and 2023 grads.
Apply Link: https://www.linkedin.com/jobs/view/3517131286
Batch eligible: 2020, 2021, 2022 and 2023 grads.
Apply Link: https://www.linkedin.com/jobs/view/3517131286
Linkedin
bluCursor Infotech Pvt Ltd hiring Software Engineer in Indore, Madhya Pradesh, India | LinkedIn
Posted 4:43:40 AM. - Apply only if you are willing to relocate to Indore, MP & work from theโฆSee this and similar jobs on LinkedIn.
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
MPL is hiring for Android Developer Intern.
Batch eligible: All undergrad students if you have knowledge of Android Development.
Apply Link: https://www.linkedin.com/jobs/view/3513737889
Batch eligible: All undergrad students if you have knowledge of Android Development.
Apply Link: https://www.linkedin.com/jobs/view/3513737889
Linkedin
11,000+ Android Developer jobs in India (471 new)
Todayโs top 11,000+ Android Developer jobs in India. Leverage your professional network, and get hired. New Android Developer jobs added daily.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Coinbase is hiring for Software Engineer Intern role.
Batch eligible: 2023 and 2024 grads.
Apply Link: https://www.coinbase.com/careers/positions/4915238
P.S. if possible try to Referral
Batch eligible: 2023 and 2024 grads.
Apply Link: https://www.coinbase.com/careers/positions/4915238
P.S. if possible try to Referral
Coinbase
Not found - Coinbase
Coinbase is a secure online platform for buying, selling, transferring, and storing cryptocurrency.
Tata Steel 11am Answers
Q1) seven men M1
60kg
B
Q3) the avarage marks
B
63
Q4) a man travels
16km/hr
Q5) in a test a student got
D
120.
Q6) 200 people
15
B
Q7) there are two sections
A
36years
Q8)there are 5 people
C
Uncertain
Q9) there are 6 countries
A
True
10)there are 5 cities
C
Verbal ability
Q1) we had dinner
Option a
Ans a
Q2) she knows
C
Knowing
Q3) the following questions
D
No error
Q1) seven men M1
60kg
B
Q3) the avarage marks
B
63
Q4) a man travels
16km/hr
Q5) in a test a student got
D
120.
Q6) 200 people
15
B
Q7) there are two sections
A
36years
Q8)there are 5 people
C
Uncertain
Q9) there are 6 countries
A
True
10)there are 5 cities
C
Verbal ability
Q1) we had dinner
Option a
Ans a
Q2) she knows
C
Knowing
Q3) the following questions
D
No error
Tata Steel
Coding Marathon
Python 3โ
Coding Marathon
Python 3โ
int countNecklaces(int maxPearls, int startMagnificence, int endMagnificence) {
int count = 0;
for (int pearls = 1; pearls <= maxPearls; pearls++) {
for (int magnificence = startMagnificence; magnificence <= endMagnificence; magnificence++) {
if (pearls == 1) {
count++;
} else {
int prevCount = count;
for (int prevMagnificence = startMagnificence; prevMagnificence <= magnificence; prevMagnificence++) {
count += prevCount;
}
}
}
}
return count;
}
C++โ
Charles and Neckless
int count = 0;
for (int pearls = 1; pearls <= maxPearls; pearls++) {
for (int magnificence = startMagnificence; magnificence <= endMagnificence; magnificence++) {
if (pearls == 1) {
count++;
} else {
int prevCount = count;
for (int prevMagnificence = startMagnificence; prevMagnificence <= magnificence; prevMagnificence++) {
count += prevCount;
}
}
}
}
return count;
}
C++โ
Charles and Neckless