Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
PayPal Hiring 2023 Batch
Role - Software Engineer
https://paypal.eightfold.ai/careers/job?domain=paypal.com&pid=274895032457&query=R0105135&domain=paypal.com&sort_by=relevance&job_index=0
Role - Software Engineer
https://paypal.eightfold.ai/careers/job?domain=paypal.com&pid=274895032457&query=R0105135&domain=paypal.com&sort_by=relevance&job_index=0
๐1
Edgeverve palindrome code
#python 3
#python 3
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Samsung Diversity Hiring for Women's ๐ฉ๐ปโ๐ฆฑ
Batch 2023 | Role - SDET
Location - Chennai
https://lnkd.in/dYSkui8j
Batch 2023 | Role - SDET
Location - Chennai
https://lnkd.in/dYSkui8j
LinkedIn
LinkedIn: Log In or Sign Up
1 billion 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 : Stripe
Batch : 2024 passouts
Role : Software Engineer , new grad
Salary Range : 20 Lakhs+ p.a.
Link to apply : https://stripe.com/jobs/listing/software-engineering-new-grad/5306085
Batch : 2024 passouts
Role : Software Engineer , new grad
Salary Range : 20 Lakhs+ p.a.
Link to apply : https://stripe.com/jobs/listing/software-engineering-new-grad/5306085
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Salesforce
Role: Software Engineer AMTS
Batch eligible: 2024 grads only
Apply: https://salesforce.wd12.myworkdayjobs.com/en-US/External_Career_Site/job/Software-Engineering-AMTS_JR211332-2
Note: Go with Referral
Role: Software Engineer AMTS
Batch eligible: 2024 grads only
Apply: https://salesforce.wd12.myworkdayjobs.com/en-US/External_Career_Site/job/Software-Engineering-AMTS_JR211332-2
Note: Go with Referral
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Loveco hiring operations intern
Batch - 2023 / 2024
Apply - https://www.linkedin.com/jobs/view/3689889300
Batch - 2023 / 2024
Apply - https://www.linkedin.com/jobs/view/3689889300
Linkedin
Loveco hiring Operations Intern in Bengaluru East, Karnataka, India | LinkedIn
Posted 7:19:11 PM. Company OverviewLoveco is a leading studio management tech tool company dedicated to creatingโฆ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)
Mahindra and Mahindra is hiring Data Analyst Intern
For 2024 Grads
Duration: 6 months
Expected Stipend: 30k per month
https://www.pluginlive.com/Job/411aa834-fd7a-4077-96a6-9c8589c9e8e4/16907e1c-6fb3-4342-bc43-99b346675fae
For 2024 Grads
Duration: 6 months
Expected Stipend: 30k per month
https://www.pluginlive.com/Job/411aa834-fd7a-4077-96a6-9c8589c9e8e4/16907e1c-6fb3-4342-bc43-99b346675fae
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: CelebAI Technologies
Role: Associate Software Engineer
Batch eligible: 2022 and 2023 grads
Apply: https://www.linkedin.com/jobs/view/3695970452
Role: Associate Software Engineer
Batch eligible: 2022 and 2023 grads
Apply: https://www.linkedin.com/jobs/view/3695970452
Linkedin
CelebAI Technologies hiring Associate Software Engineer in Delhi, India | LinkedIn
Posted 5:04:19 AM. About us:Celeb-AI is a specialised Artificial Intelligence solutions company. Our advanced trainingโฆ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)
Company Name: Microsoft
Role: Technical Program Manager Intern
Batch eligible: 2024 grads only
Apply: https://jobs.careers.microsoft.com/us/en/job/1596049/Internship-Opportunity-for-Technical-Program-Manager?jobsource=linkedin
Role: Technical Program Manager Intern
Batch eligible: 2024 grads only
Apply: https://jobs.careers.microsoft.com/us/en/job/1596049/Internship-Opportunity-for-Technical-Program-Manager?jobsource=linkedin
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Atlassian Women in tech hiring
Batch -2025
Apply -
https://flows.beamery.com/atlassian/women-in-tech-3-0-qvmvsejhw
Batch -2025
Apply -
https://flows.beamery.com/atlassian/women-in-tech-3-0-qvmvsejhw
Beamery
Loading...
A Beamery web application
๐2
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
long double pi = 3.14159265358979323846;
long double volume(long double h, long double r) {
return pi * h * h * (r - h/3);
}
long double find_height(long double r, long double v) {
long double low = 0, high = r;
long double eps = 1e-18;
while (high - low > eps) {
long double mid = (low + high) / 2;
if (volume(mid, r) < v) {
low = mid;
} else {
high = mid;
}
}
return low;
}
int main() {
long double r, v;
cin >> r >> v;
long double h = find_height(r, v);
cout << fixed << setprecision(7) << h << endl;
return 0;
}
Astrome || Binary Searchโ
#include <cmath>
#include <iomanip>
using namespace std;
long double pi = 3.14159265358979323846;
long double volume(long double h, long double r) {
return pi * h * h * (r - h/3);
}
long double find_height(long double r, long double v) {
long double low = 0, high = r;
long double eps = 1e-18;
while (high - low > eps) {
long double mid = (low + high) / 2;
if (volume(mid, r) < v) {
low = mid;
} else {
high = mid;
}
}
return low;
}
int main() {
long double r, v;
cin >> r >> v;
long double h = find_height(r, v);
cout << fixed << setprecision(7) << h << endl;
return 0;
}
Astrome || Binary Searchโ
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
string sortWord(string word) {
transform(word.begin(), word.end(), word.begin(), ::tolower);
vector<char> charArr(word.begin(), word.end());
int sum = 0;
for (char ch : charArr) {
sum += ch - 'a' + 1;
}
sort(charArr.begin(), charArr.end());
if (sum % 2 == 0) {
return string(charArr.begin(), charArr.end());
}
reverse(charArr.begin(), charArr.end());
return string(charArr.begin(), charArr.end());
}
int main() {
string s;
getline(cin, s);
vector<string> strArr;
size_t pos = 0;
string delimiter = "-";
while ((pos = s.find(delimiter)) != string::npos) {
strArr.push_back(s.substr(0, pos));
s.erase(0, pos + delimiter.length());
}
strArr.push_back(s);
sort(strArr.begin(), strArr.end(), [](string a, string b) {
transform(a.begin(), a.end(), a.begin(), ::tolower);
transform(b.begin(), b.end(), b.begin(), ::tolower);
return a < b;
});
transform(strArr.begin(), strArr.end(), strArr.begin(), sortWord);
string result = strArr[0];
for (int i = 1; i < strArr.size(); i++) {
result += "-" + strArr[i];
}
cout << result << endl;
return 0;
}
Astrome||Sort Wordโ
#include <algorithm>
#include <vector>
using namespace std;
string sortWord(string word) {
transform(word.begin(), word.end(), word.begin(), ::tolower);
vector<char> charArr(word.begin(), word.end());
int sum = 0;
for (char ch : charArr) {
sum += ch - 'a' + 1;
}
sort(charArr.begin(), charArr.end());
if (sum % 2 == 0) {
return string(charArr.begin(), charArr.end());
}
reverse(charArr.begin(), charArr.end());
return string(charArr.begin(), charArr.end());
}
int main() {
string s;
getline(cin, s);
vector<string> strArr;
size_t pos = 0;
string delimiter = "-";
while ((pos = s.find(delimiter)) != string::npos) {
strArr.push_back(s.substr(0, pos));
s.erase(0, pos + delimiter.length());
}
strArr.push_back(s);
sort(strArr.begin(), strArr.end(), [](string a, string b) {
transform(a.begin(), a.end(), a.begin(), ::tolower);
transform(b.begin(), b.end(), b.begin(), ::tolower);
return a < b;
});
transform(strArr.begin(), strArr.end(), strArr.begin(), sortWord);
string result = strArr[0];
for (int i = 1; i < strArr.size(); i++) {
result += "-" + strArr[i];
}
cout << result << endl;
return 0;
}
Astrome||Sort Wordโ