Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Data Bricks is hiring Data Science Intern
2024 2025 Batch.
https://www.databricks.com/company/careers/university-recruiting/data-science-intern-2024-start-6866538002
2024 2025 Batch.
https://www.databricks.com/company/careers/university-recruiting/data-science-intern-2024-start-6866538002
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: CRED
Role: SDET Intern (Frontend)
Batch eligible: 2023 and 2024 grads
Apply: https://jobs.lever.co/cred/18e23dcb-a3ce-4884-bf04-bcdbd25c85f0
Role: SDET Intern (Frontend)
Batch eligible: 2023 and 2024 grads
Apply: https://jobs.lever.co/cred/18e23dcb-a3ce-4884-bf04-bcdbd25c85f0
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Zoho
Role: Software Engineer
Batch eligible: 2021, 2022 and 2023 grads
Exam Date: 9th Sep, 2023
Apply: https://bit.ly/45V8xtm
Role: Software Engineer
Batch eligible: 2021, 2022 and 2023 grads
Exam Date: 9th Sep, 2023
Apply: https://bit.ly/45V8xtm
Zoho Corporation
Zoho | Participation Confirmation
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name : ServiceNow
Role : Associate Software Engineer
Batch : 2023/2022 passouts
CTC : 18-25 LPA
Link : https://jobs.smartrecruiters.com/servicenow/743999927593453-assoc-software-engineer
Role : Associate Software Engineer
Batch : 2023/2022 passouts
CTC : 18-25 LPA
Link : https://jobs.smartrecruiters.com/servicenow/743999927593453-assoc-software-engineer
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Avaloq is hiring
Batch : 2022/2023
Link : https://www.linkedin.com/jobs/collections/recommended/?currentJobId=3703695034
Batch : 2022/2023
Link : https://www.linkedin.com/jobs/collections/recommended/?currentJobId=3703695034
Linkedin
Sign Up | LinkedIn
500 million+ members | Manage your professional identity. Build and engage with your professional network. Access knowledge, insights and opportunities.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Google
Role: Software Engineer Intern
Batch eligible: 2024 grads only
Location: Bangalore
Last day to apply: Ist October, 2023
Apply: https://bit.ly/3stLpUn
Role: Software Engineer Intern
Batch eligible: 2024 grads only
Location: Bangalore
Last day to apply: Ist October, 2023
Apply: https://bit.ly/3stLpUn
#include<bits/stdc++.h>
using namespace std;
int ByServer(vector<int>& req) {
int b = 0;
for(int i = 0; i < req.size(); i += 2) {
b += req[i];
}
return b;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
cout << ByServer(a) << endl;
return 0;
}
using namespace std;
int ByServer(vector<int>& req) {
int b = 0;
for(int i = 0; i < req.size(); i += 2) {
b += req[i];
}
return b;
}
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
cout << ByServer(a) << endl;
return 0;
}
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ
Photo
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
double areaOfIntersection(int centerx1, int centery1, int radius1,
int centerx2, int centery2, int radius2) {
double distance = sqrt(pow(centerx2 - centerx1, 2) + pow(centery2 - centery1, 2));
if(distance >= (radius1 + radius2)) {
return 0.0;
}
double part1 = radius1 * radius1 * acos((distance * distance + radius1 * radius1 - radius2 * radius2) / (2 * distance * radius1));
double part2 = radius2 * radius2 * acos((distance * distance + radius2 * radius2 - radius1 * radius1) / (2 * distance * radius2));
double part3 = 0.5 * sqrt((-distance + radius1 + radius2) * (distance + radius1 - radius2) * (distance - radius1 + radius2) * (distance + radius1 + radius2));
return part1 + part2 - part3;
}
int main() {
int centerx1, centery1, radius1, centerx2, centery2, radius2;
cin >> centerx1 >> centery1 >> radius1 >> centerx2 >> centery2 >> radius2;
double answer = areaOfIntersection(centerx1, centery1, radius1, centerx2, centery2, radius2);
cout << fixed << setprecision(6) << answer << endl;
return 0;
}
C++โ
#include <cmath>
#include <iomanip>
using namespace std;
double areaOfIntersection(int centerx1, int centery1, int radius1,
int centerx2, int centery2, int radius2) {
double distance = sqrt(pow(centerx2 - centerx1, 2) + pow(centery2 - centery1, 2));
if(distance >= (radius1 + radius2)) {
return 0.0;
}
double part1 = radius1 * radius1 * acos((distance * distance + radius1 * radius1 - radius2 * radius2) / (2 * distance * radius1));
double part2 = radius2 * radius2 * acos((distance * distance + radius2 * radius2 - radius1 * radius1) / (2 * distance * radius2));
double part3 = 0.5 * sqrt((-distance + radius1 + radius2) * (distance + radius1 - radius2) * (distance - radius1 + radius2) * (distance + radius1 + radius2));
return part1 + part2 - part3;
}
int main() {
int centerx1, centery1, radius1, centerx2, centery2, radius2;
cin >> centerx1 >> centery1 >> radius1 >> centerx2 >> centery2 >> radius2;
double answer = areaOfIntersection(centerx1, centery1, radius1, centerx2, centery2, radius2);
cout << fixed << setprecision(6) << answer << endl;
return 0;
}
C++โ
#include<bits/stdc++.h>
using namespace std;
int maxWeeks(vector<int>& a) {
int n = a.size();
sort(a.begin(), a.end(), greater<int>());
int b = 0;
int c = 0;
int d = -1;
while (true) {
if (c != d && a[c] > 0) {
a[c]--;
b++;
d = c;
c = 0;
} else {
c++;
if (c == n) break;
}
}
return b;
}
int main() {
int e;
cin >> e;
vector<int> a(e);
for (int i = 0; i < e; i++) {
cin >> a[i];
}
cout << maxWeeks(a) << endl;
return 0;
}
C++โ
using namespace std;
int maxWeeks(vector<int>& a) {
int n = a.size();
sort(a.begin(), a.end(), greater<int>());
int b = 0;
int c = 0;
int d = -1;
while (true) {
if (c != d && a[c] > 0) {
a[c]--;
b++;
d = c;
c = 0;
} else {
c++;
if (c == n) break;
}
}
return b;
}
int main() {
int e;
cin >> e;
vector<int> a(e);
for (int i = 0; i < e; i++) {
cin >> a[i];
}
cout << maxWeeks(a) << endl;
return 0;
}
C++โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
HRT is Hiring !!
Role: Software Engineer (C++/Python)
Batch: 2024
Location: Singapore
Apply here- https://www.hudsonrivertrading.com/careers/job/?gh_jid=5324577
Role: Software Engineer (C++/Python)
Batch: 2024
Location: Singapore
Apply here- https://www.hudsonrivertrading.com/careers/job/?gh_jid=5324577
Hudson River Trading
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Enterprise Bot is Hiring !!
Role: DevOps Engineer- Trainee
Batch: 2023, 2022
Location: Bangalore
Link : https://join.com/companies/enterprisebot/9051204-devops-engineer-trainee
Role: DevOps Engineer- Trainee
Batch: 2023, 2022
Location: Bangalore
Link : https://join.com/companies/enterprisebot/9051204-devops-engineer-trainee