#include<iostream>
#include<string>
#include<cmath>
using namespace std;
bool isVowel(char ch) {
if(ch == 'a'ch == 'e' ch == 'i' ch == 'o' ch == 'u') {
return true;
}
return false;
}
int main() {
string Str;
cin >> Str;
string binaryString = "";
for(char ch : Str) {
if(isVowel(ch)) {
binaryString += '0';
} else {
binaryString += '1';
}
}
int decimalValue = 0;
int n = binaryString.length();
for(int i = 0; i < n; i++) {
if(binaryString[i] == '1') {
decimalValue += pow(2, n - i - 1);
}
}
cout << decimalValue << endl;
return 0;
}
Providence C++โ
#include<string>
#include<cmath>
using namespace std;
bool isVowel(char ch) {
if(ch == 'a'
return true;
}
return false;
}
int main() {
string Str;
cin >> Str;
string binaryString = "";
for(char ch : Str) {
if(isVowel(ch)) {
binaryString += '0';
} else {
binaryString += '1';
}
}
int decimalValue = 0;
int n = binaryString.length();
for(int i = 0; i < n; i++) {
if(binaryString[i] == '1') {
decimalValue += pow(2, n - i - 1);
}
}
cout << decimalValue << endl;
return 0;
}
Providence C++โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Technip Energies is Hiring !!
Role: Graduate Trainee โ Data Analytics
Batch: 2023
Location: Noida
Apply Now: https://hcxg.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/job/4109/
Role: Graduate Trainee โ Data Analytics
Batch: 2023
Location: Noida
Apply Now: https://hcxg.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/job/4109/
T.EN Career Site
Graduate Trainee - Data Analytics
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Coca-Cola Hiring:
Opportunity Name: Coca Cola Disrupt Season 3
Eligibility: B.E/B.Tech, M.Tech,MBA/PGDM
Last Date to Apply: 27 August
Apply Now: https://tinyurl.com/cocacolaOOJ
Opportunity Name: Coca Cola Disrupt Season 3
Eligibility: B.E/B.Tech, M.Tech,MBA/PGDM
Last Date to Apply: 27 August
Apply Now: https://tinyurl.com/cocacolaOOJ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
๐๐จ๐ฆ๐ฉ๐๐ง๐ฒ ๐๐๐ฆ๐: Unisys
๐๐จ๐ฅ๐: Associate Development Engineer
๐๐๐ญ๐๐ก ๐๐ฅ๐ข๐ ๐ข๐๐ฅ๐: 2021, 2022 and 2023 grads.
https://jobs.unisys.com/us/en/job/REQ549425/Associate-Development-Engineer
๐๐จ๐ฅ๐: Associate Development Engineer
๐๐๐ญ๐๐ก ๐๐ฅ๐ข๐ ๐ข๐๐ฅ๐: 2021, 2022 and 2023 grads.
https://jobs.unisys.com/us/en/job/REQ549425/Associate-Development-Engineer
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
๐๐จ๐ฆ๐ฉ๐๐ง๐ฒ ๐๐๐ฆ๐: AlphaBI Solutions
๐๐จ๐ฅ๐: FullStack Developer Internship
๐๐๐ญ๐๐ก ๐๐ฅ๐ข๐ ๐ข๐๐ฅ๐: 2023 and 2024 grads
https://cuvette.tech/app/public/internship/64e8acfd959098b5a5169237?referralCode=Z21QGT
๐๐จ๐ฅ๐: FullStack Developer Internship
๐๐๐ญ๐๐ก ๐๐ฅ๐ข๐ ๐ข๐๐ฅ๐: 2023 and 2024 grads
https://cuvette.tech/app/public/internship/64e8acfd959098b5a5169237?referralCode=Z21QGT
cuvette.tech
Fullstack Developer Internship in AlphaBI Solutions Pvt. Ltd at Surat, Gujarat, India | Cuvette
Apply For Fullstack Developer Internship | Skills required are React.js, MongoDB, API | Stipend โน8K-15K | Job Offer โน 4.5 LPA - 8 LPA | FULL-TIME INTERNSHIP | Location is Work from Home
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Akamai
Role: Software Engineer
Batch eligible: 2022 and 2023 grads
Apply: https://akamaicareers.inflightcloud.com/jobdetails/aka_ext/032243?src=JB-10220&job=032243&lang=en
Note: 100% remote opportunity!!
Role: Software Engineer
Batch eligible: 2022 and 2023 grads
Apply: https://akamaicareers.inflightcloud.com/jobdetails/aka_ext/032243?src=JB-10220&job=032243&lang=en
Note: 100% remote opportunity!!
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Freshworks is Hiring !!!
Role: Graduate Trainee
Batch: 2023
Location: Chennai
Apply here- https://jobs.smartrecruiters.com/Freshworks/743999925886087-graduate-trainee-customer-support
Role: Graduate Trainee
Batch: 2023
Location: Chennai
Apply here- https://jobs.smartrecruiters.com/Freshworks/743999925886087-graduate-trainee-customer-support
Smartrecruiters
Freshworks Graduate Trainee - Customer Support | SmartRecruiters
About the role - Customer Support:
The customer support team takes care of technical account management for all our customers. They help troubleshoot and resolve issues that customers might have and provide assistance as and when required. Anyone who likesโฆ
The customer support team takes care of technical account management for all our customers. They help troubleshoot and resolve issues that customers might have and provide assistance as and when required. Anyone who likesโฆ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
PrepTrain Hiring for 6 Months Growth Interns
Batch: 2025 / 2026 / 2027
Location: Fully Remote
Apply here on below
https://forms.gle/1dz2gjdUZaarBM4M9
Batch: 2025 / 2026 / 2027
Location: Fully Remote
Apply here on below
https://forms.gle/1dz2gjdUZaarBM4M9
Google Docs
PrepTrain Hiring for Growth Intern
PrepTrain ( https://telegram.me/PrepTrain ) is an active community of 17000 + College Students , Where Off- campus full-time SDE and internships opportunities are shared daily.
PrepTrain Community is managed by Saheb Kumar (Ex- Amazon , Currently @ShareChatโฆ
PrepTrain Community is managed by Saheb Kumar (Ex- Amazon , Currently @ShareChatโฆ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Linkedin
65 Machine Learning Intern jobs in India
Todayโs top 65 Machine Learning Intern jobs in India. Leverage your professional network, and get hired. New Machine Learning Intern jobs added daily.
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Company Name: Uni Cards
Role: SDE 1 - Backend
Batch eligible: 2022 and 2023 grads
Apply: https://docs.google.com/forms/d/e/1FAIpQLSc90e-pYGZehRCToicgqdzkoZHJXaRb_WOsOAgX9HVv2FNSMA/alreadyresponded
Note: Interview will be on 9th Sep, 2023 at Uni Card office Bangalore.
Role: SDE 1 - Backend
Batch eligible: 2022 and 2023 grads
Apply: https://docs.google.com/forms/d/e/1FAIpQLSc90e-pYGZehRCToicgqdzkoZHJXaRb_WOsOAgX9HVv2FNSMA/alreadyresponded
Note: Interview will be on 9th Sep, 2023 at Uni Card office Bangalore.
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ pinned ยซAtlassian Interview Experience โ๐ป https://medium.com/@ritinema23/atlassian-interview-experience-bee07be0bddfยป
#include <bits/stdc++.h>
using namespace std;
vector<long long> palindromes;
long long cal(string p)
{
string p1 = p;
reverse(p1.begin(), p1.end());
p += p1;
long long ans = 0;
for (int i = p.size() - 1; i >= 0; i--)
{
if (p[i] == '1')
ans += (1LL << (p.size() - 1 - i));
}
return ans;
}
long long cal1(string p)
{
string p1 = p;
reverse(p1.begin(), p1.end());
p1.erase(p1.begin());
p += p1;
long long ans = 0;
for (int i = p.size() - 1; i >= 0; i--)
{
if (p[i] == '1')
ans += (1LL << (p.size() - 1 - i));
}
return ans;
}
void f(int idx, string p, int flag)
{
if (idx == 16)
{
palindromes.push_back(cal(p));
if (!p.empty())
palindromes.push_back(cal1(p));
return;
}
if (flag == 0)
{
f(idx + 1, p, 0);
f(idx + 1, p + "1", 1);
}
else
{
f(idx + 1, p + "0", 1);
f(idx + 1, p + "1", 1);
}
}
int main()
{
int t;
long long idx, ans, n;
cin >> t;
f(0, "", 0);
sort(palindromes.begin(), palindromes.end());
while (t--)
{
cin >> n;
idx = lower_bound(palindromes.begin(), palindromes.end(), n) - palindromes.begin();
ans = palindromes[idx] - n;
if (idx > 0)
ans = min(ans, n - palindromes[idx - 1]);
cout << ans << endl;
}
return 0;
}
Binary palindrome number โ
using namespace std;
vector<long long> palindromes;
long long cal(string p)
{
string p1 = p;
reverse(p1.begin(), p1.end());
p += p1;
long long ans = 0;
for (int i = p.size() - 1; i >= 0; i--)
{
if (p[i] == '1')
ans += (1LL << (p.size() - 1 - i));
}
return ans;
}
long long cal1(string p)
{
string p1 = p;
reverse(p1.begin(), p1.end());
p1.erase(p1.begin());
p += p1;
long long ans = 0;
for (int i = p.size() - 1; i >= 0; i--)
{
if (p[i] == '1')
ans += (1LL << (p.size() - 1 - i));
}
return ans;
}
void f(int idx, string p, int flag)
{
if (idx == 16)
{
palindromes.push_back(cal(p));
if (!p.empty())
palindromes.push_back(cal1(p));
return;
}
if (flag == 0)
{
f(idx + 1, p, 0);
f(idx + 1, p + "1", 1);
}
else
{
f(idx + 1, p + "0", 1);
f(idx + 1, p + "1", 1);
}
}
int main()
{
int t;
long long idx, ans, n;
cin >> t;
f(0, "", 0);
sort(palindromes.begin(), palindromes.end());
while (t--)
{
cin >> n;
idx = lower_bound(palindromes.begin(), palindromes.end(), n) - palindromes.begin();
ans = palindromes[idx] - n;
if (idx > 0)
ans = min(ans, n - palindromes[idx - 1]);
cout << ans << endl;
}
return 0;
}
Binary palindrome number โ
#include <bits/stdc++.h>
using namespace std;
int findPairs(vector<pair<int, int>>& array, int size) {
set<pair<int, int>> pairsSet;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
if (i != j && pairsSet.find({i, j}) == pairsSet.end() && pairsSet.find({j, i}) == pairsSet.end()) {
if ((array[i].second * (array[j].first - array[i].first)) == (array[i].first * (array[j].second - array[i].second))) {
pairsSet.insert({i, j});
}
}
}
}
return pairsSet.size();
}
int main() {
int t;
cin >> t;
for (int testCase = 1; testCase <= t; testCase++) {
int size;
cin >> size;
vector<pair<int, int>> array(size);
for (int i = 0; i < size; i++) {
cin >> array[i].first >> array[i].second;
}
int result = findPairs(array, size);
cout << result << endl;
}
return 0;
}
Pair of points โ
using namespace std;
int findPairs(vector<pair<int, int>>& array, int size) {
set<pair<int, int>> pairsSet;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++) {
if (i != j && pairsSet.find({i, j}) == pairsSet.end() && pairsSet.find({j, i}) == pairsSet.end()) {
if ((array[i].second * (array[j].first - array[i].first)) == (array[i].first * (array[j].second - array[i].second))) {
pairsSet.insert({i, j});
}
}
}
}
return pairsSet.size();
}
int main() {
int t;
cin >> t;
for (int testCase = 1; testCase <= t; testCase++) {
int size;
cin >> size;
vector<pair<int, int>> array(size);
for (int i = 0; i < size; i++) {
cin >> array[i].first >> array[i].second;
}
int result = findPairs(array, size);
cout << result << endl;
}
return 0;
}
Pair of points โ