📌Salescode.ai is Hiring Sofware Engineer Trainee

For 2023, 2024 grads
Location: Gurugram

💻Apply: https://salescodeai.keka.com/careers/jobdetails/68945

https://jobs.siemens.com/careers/job/563156117078995?hl=en

Freshers with M. tech/B.Tech. in Electrical/Electrical & Electronics Engineering or Diploma in Electrical/Electrical & Electronics with relevant experience

🚀 Hiring Freshers

Role: DevOps Intern / Junior DevOps Engineer at ReBid

🔍 What We're Looking For:
- Strong understanding of AWS ☁️
- Linux expertise 🐧
- Experience with Docker & Kubernetes 🐳
- Familiarity with CI/CD pipelines for continuous integration and deployment automation 🔄

✨Bonus Points if you have:
- Hands-on experience with Terraform or other Infrastructure as Code tools
- Knowledge of Ansible for configuration management
Experience

📩 Send your resume to deepak.suhag@rebid.co

#include <bits/stdc++.h>

#define ll long long
using namespace std;
int main() {
    ll n;
    cin >> n;
    vector<int> f(7, 0);
    for (ll i = 0; i < n; ++i) {
        int num;
        cin >> num;
        f[num]++;
    }
    ll a =  *min_element(f.begin() + 1, f.end());
    ll b = a * 6;
    ll c = n - b;
    cout << c << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int maximumNetworks(int *speed,int n,int minComps,long speedThreshold)
{
long long int count=0,sum=0,b; 

for(int i=0;i<n;i++)
{
  sum=sum+speed[i];
   b++;
  if(b>=minComps && sum>=speedThreshold)
  {
   count++;
   sum=0;
   b=0;
   }
  }

  return count;
}

Twilio ✅

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool comparator(pair<int, int>& a, pair<int, int>& b) {
    return (a.first - a.second) > (b.first - b.second);
}

long planProduction(vector<int> worstCase, vector<int> expected) {
    int n = worstCase.size();
    vector<pair<int, int>> products(n);
    
    for (int i = 0; i < n; i++) {
        products[i] = {worstCase[i], expected[i]};
    }
    
    sort(products.begin(), products.end(), comparator);
    
    long startingCash = 0;
    long cashOnHand = 0;
    
    for (int i = 0; i < n; i++) {
        int worst = products[i].first;
        int expect = products[i].second;
        
        if (cashOnHand < worst) {
            startingCash += worst - cashOnHand;
            cashOnHand = worst; 
        }
        
        cashOnHand -= expect;
    }
    
    return startingCash;
}

Twilio ✅

#include <iostream>
#include <unordered_map>
#include <vector>
#include <string>
using namespace std;
vector<string> rateLimiter(vector<string>& requests, vector<int>& timestamps) {
    unordered_map<string, vector<int>> domainRequests;
    vector<string> result;
    
    for (int i = 0; i < requests.size(); i++) {
        string domain = requests[i];
        int time = timestamps[i];
        vector<int>& reqs = domainRequests[domain];  
        vector<int> last30;
        for (int t : reqs) {
            if (time - t <= 30) {
                last30.push_back(t);
            }
        }
                vector<int> last5;
        for (int t : last30) {
            if (time - t <= 5) {
                last5.push_back(t);
            }
        }

        if (last5.size() >= 2) {
            result.push_back("{status: 429, message: Too many requests}");
        } else if (last30.size() >= 5) {
            result.push_back("{status: 429, message: Too many requests}");
        } else {
            result.push_back("{status: 200, message: OK}");
            last30.push_back(time); 
        }
        
        domainRequests[domain] = last30;
    }
    
    return result;
}

Twilio ✅

Interested candidates can submit CV on:

resume@technokrate.com
+91 8956992805

📌FIS is Hiring
UI Developer (React and Java8)

For 2021, 2022, 2023, 2024 grads
Experience: 0 - 4 years

- 0-4 years of experience working as UI or full stack web developer

Location: Bangalore

💻Apply: https://careers.fisglobal.com/us/en/job/FIGLUSJR0283138EXTERNAL/UI-Developer-React-and-Java8?s=09

#include <iostream>
#include <vector>
using namespace std;

bool hasConsecutiveOnes(int num) {
    return (num & (num >> 1)) != 0;
}

int solve(int p) {
    if (!hasConsecutiveOnes(p)) {
        return p;
    }

    int mask = 1;

    for (int i = 30; i >= 0; --i) {
        int bit_i = (p >> i) & 1;
        int bit_i_next = (p >> (i + 1)) & 1;

        if (bit_i == 1 && bit_i_next == 1) {
            mask = (1 << (i + 1)) - 1;
            p = (p & ~mask) + (1 << (i + 1));
            break;
        }
    }

    return solve(p);
}

int main() {
     int t; 
    cin >> t;
      while (t--) {
    int p;
    cin >> p;
    
    cout << solve(p) << endl;
      }
    return 0;
}

AMD ✅

#include <bits/stdc++.h> 
using namespace std; 
#define ll long long 
map<string, map<string, ll>> user; 
map<string, ll> users; 
set<string> banks; 
vector<string> split(const string &s) { 
    stringstream ss(s); 
    vector<string> result; 
    string token; 

    while (getline(ss, token, ',')) { 
        result.push_back(token); 
    } 
    return result; 
}
void init(string &s) { 
    vector<string> bankers = split(s); 
    ll balance = stoll(bankers[2]); 
    users[bankers[1]] = balance; 
    for (int i = 3; i < bankers.size(); i++) { 
        user[bankers[1]].insert({bankers[i], balance}); 
        banks.insert(bankers[i]); 
    } 
}
string post(string &s) { 
    vector<string> help = split(s); 
    ll value = stoll(help[4]); 
    
    if (banks.find(help[2]) != banks.end() && banks.find(help[3]) != banks.end()) 
        return "FAILURE"; 
    
    if (banks.find(help[3]) != banks.end()) { 
        if (users.find(help[2]) == users.end()) return "FAILURE"; 
        if (user[help[2]].find(help[3]) == user[help[2]].end()) return "FAILURE"; 
        if (users[help[2]] < value) return "FAILURE"; 
        users[help[2]] -= value; 
        return "SUCCESS"; 
    } 
    
    if (banks.find(help[2]) != banks.end()) { 
        if (users.find(help[3]) == users.end()) return "FAILURE"; 
        if (user[help[3]].find(help[2]) == user[help[3]].end()) return "FAILURE"; 
        users[help[3]] += value; 
        return "SUCCESS"; 
    } 
    
    if (users.find(help[2]) == users.end() || users.find(help[3]) == users.end()) return "FAILURE"; 
    if (users[help[2]] < value) return "FAILURE"; 
    users[help[2]] -= value; 
    users[help[3]] += value; 
    return "SUCCESS"; 
}

string get(string &s) { 
    vector<string> help = split(s); 
    if (users.find(help[2]) == users.end()) return "FAILURE"; 
    return to_string(users[help[2]]); 
}
static bool comp(const string &x, const string &y) { 
    vector<string> a = split(x); 
    vector<string> b = split(y); 
    return stoll(a[1]) < stoll(b[1]); 
}

string get_command_results(vector<string> commands) { 
    vector<string> check; 
        for (auto &it : commands) { 
        if (it[0] == 'I') { 
            init(it); 
        } else { 
            check.push_back(it); 
        } 
    } 
    
    sort(check.begin(), check.end(), comp); 
    map<string, string> res; 
        for (auto &it : check) { 
        if (it[0] == 'P') { 
            res[it] = post(it); 
        } 
        if (it[0] == 'G') { 
            res[it] = get(it); 
        } 
    } 
    
    string ans; 
    for (auto &it : commands) { 
        if (res.find(it) != res.end()) {
            if (!ans.empty()) ans += ",";
            ans += res[it];
        } 
    } 
    
    return ans;  
}

Account Balance manager : StripePay Backend ✅

Stripe ✅

#include <iostream>
#include <vector>
#include <string>
using namespace std;
bool s(const string& s1, const string& s2) {
    if (s1.size() != s2.size()) return false;
    int diffCount = 0;
    for (int i = 0; i < s1.size(); ++i) {
    if (s1[i] != s2[i]) {
        diffCount++;
        }
    if (diffCount > 1) return false; 
    }
    return (diffCount == 1);
}
vector<string> solve(const vector<string>& start, const vector<string>& fin) {
    vector<string> result(fin.size(), "NO");
    for (int i = 0; i < fin.size(); ++i) {
    for (const string& startStr : start) {
    if (s(startStr, fin[i])) {
    result[i] = "YES";
    break;
            }
        }
    }

    return result;
}
int main() {
    int n, m;
    cin >> n;
    vector<string> start(n);
    for (int i = 0; i < n; ++i) {
        cin >> start[i];
    }
    cin >> m;
    vector<string> fin(m);
    for (int i = 0; i < m; ++i) {
        cin >> fin[i];
    }
    vector<string> result = solve(start, fin);
    for (const string& res : result) {
        cout << res << endl;
    }
    return 0;
}

String operation ✅

Company Name : Snowflake
Hackathon Name : Snowflake AI Hackathon 2024
Batch : College Students + Working Professionals

Link : https://bit.ly/SnowflakeAIHackathon

Last date to register is asap.