#include <bits/stdc++.h>
using namespace std;
void print(vector<int> &arr)
{
  for(auto e:arr) cout<<e<<" "; cout<<endl;
}
vector<int> solv(int n,vector<int> &arr)
{
  vector<int> soln;
  for(int i=0;i<n;i++)
  {
    if(arr[i]%2 == 0 || arr[i]%3 == 0 || arr[i]%5 == 0) soln.push_back(arr[i]);
  }
  return soln;
}
int main() 
{
    int n;
    cin>>n;
    vector<int> arr(n);
    for(int i=0;i<n;i++) cin>>arr[i];
    vector<int> ans = solv(n,arr); print(ans);
    return 0;
}

Deloitte ✅

Batch 2024/2025
if interested send your resume
hiring@xhipment.com

Company Name: GradUp

Role: FullStack Engineer

Batch eligible: 2022 and 2023 grads

Apply: https://bit.ly/49g6u5b

Company Name: S&P Global

Role: Associate Software Engineer

Batch eligible: 2022 and 2023 passouts

Apply: https://careers.spglobal.com/jobs/291161?lang=en-us

hours = int(input())
seconds = hours * 60 * 60
print(seconds)

Deloitte ✅

Company Name: Baker Hughes

Role: Software Engineer

Batch eligible: 2022 and 2023 passouts

Apply: https://bit.ly/4bDqws7

Check out this job at Bitnine Global: https://www.linkedin.com/jobs/view/3828521409

Axtria is (still) HIRING!

In the world of uncertainties, we are fortunate to find ourselves in a place where we continue to be in a great position to keep growing stronger.

This summer, as we await our campus hires, we are also rolling out an interim drive to hire a strong population of off-campus hires.

So if you:

- Are 2023/2024 batch B.Tech CS/IT from Top-200 campuses (as per NIRF rankings)
- have an impeccable academic record (10th - 90%, 12th - 80%, Graduation - 80%)
- Wish to build a career as an Analyst
- Are open to working in Delhi NCR, Bangalore, Hyderabad, Pune
- wish to improve patient outcomes

Then please email your profile at campusplacement@axtria.com

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

int solve(vector<vector<int>>& d) {
    unordered_map<int, int> b;
    for(auto& x : d) {
        b[x[0]] -= x[2];
        b[x[1]] += x[2];
    }
    vector<int> pos, neg;
    for(auto& [_, v] : b) {
        if(v > 0) pos.push_back(v);
        else if(v < 0) neg.push_back(-v);
    }
    int t = 0;
    while(!pos.empty() && !neg.empty()) {
        int m = min(pos.back(), neg.back());
        pos.back() -= m;
        neg.back() -= m;
        t++;
        if(pos.back() == 0) pos.pop_back();
        if(neg.back() == 0) neg.pop_back();
    }
    return t;
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> d(m, vector<int>(3));
    for(int i = 0; i < m; i++) {
        for(int j = 0; j < 3; j++) {
            cin >> d[i][j];
        }
    }
    cout << solve(d) << endl;
    return 0;
}

Transaction Simplification ✅

Sharechat

int solve(vector<int>& t) {
    priority_queue<int, vector<int>, greater<int>> a(t.begin(), t.end());
    queue<int> w;
    int time = 0;

    while (!a.empty() || !w.empty()) {
        if (!w.empty()) {
            time = max(time, w.front()) + 5 * 60;
            w.pop();
        } else {
            time = a.top();
        }

        while (!a.empty() && a.top() <= time) {
            if (w.size() < 10) {
                w.push(a.top());
            }
            a.pop();
        }
    }

    return time;
}

Autodesk ✅