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 ✅

Infosys Hackwithinfy 2024

B.E./ B. Tech/ M.E./ M. Tech students graduating in 2023, 2024, or 2025

https://www.infosys.com/careers/hackwithinfy.html

#include <stdio.h>

struct Triangle {
    int side1;
    int side2;
    int side3;
};

int IdentifyTriangle(struct Triangle list[], int n) {
    if (list == NULL) {
        return -1;
    }

    int scaleneCount = 0;
    int isoscelesCount = 0;
    int notTriangleCount = 0;

    for (int i = 0; i < n; i++) {
        int s1 = list[i].side1;
        int s2 = list[i].side2;
        int s3 = list[i].side3;
        if ((s1 + s2 > s3) && (s1 + s3 > s2) && (s2 + s3 > s1)) {
            if (s1 != s2 && s2 != s3 && s1 != s3) {
                scaleneCount++;
            }
            else if (s1 == s2 s2 == s3 s1 == s3) {
                isoscelesCount++;
            }
        } else {
            notTriangleCount++;
        }
    }

    return (3 * scaleneCount) - (isoscelesCount + notTriangleCount);
}

Identify triangles ✅

Deloitte
Python 3✅

int main() {
    int n;
    cin >> n;
    vector<Musician> backRow(n);
    for (int i = 0; i < n; ++i) {
        cin >> backRow[i].rank >> backRow[i].height;
    }
    vector<Musician> frontRow(n);
    for (int i = 0; i < n; ++i) {
        cin >> frontRow[i].rank >> frontRow[i].height;
    }
    vector<int> backRowPositions(n);
    vector<int> frontRowPositions(n);
    arrangeMusicians(backRow, backRowPositions);
    arrangeMusicians(frontRow, frontRowPositions);
    for (int i = 0; i < n; ++i) {
        cout << backRowPositions[i] << " ";
    }
    cout << endl;
    for (int i = 0; i < n; ++i) {
        cout << frontRowPositions[i] << " ";
    }
    cout << endl;

    return 0;
}

Maximum Tree Height - Mitsogo ✅

🌟 Hiring Alert: Associate Graphic Designer at Gartner! 🌟

Are you a talented graphic designer with 0-3 years of experience? Gartner is looking for passionate individuals to join our creative team in Gurgaon.

📍 Location: Gurgaon (Hybrid)

💼 Responsibilities:
- Create visually appealing graphics and layouts for various projects.
- Collaborate with our team to develop design concepts that align with our brand guidelines.
- Utilize Adobe Illustrator, InDesign, and MS PowerPoint to produce high-quality designs.
- Stay updated on design trends and best practices to ensure innovative and effective solutions.

🎓 Requirements:
- Bachelor's degree (Full-time)
- Proficiency in Adobe Creative Suite (Illustrator, InDesign) and MS PowerPoint.

📩 To Apply:
If you're ready to take your design skills to the next level, we want to hear from you! Send your updated CV and portfolio to me at priyanka.chutani@gartner.com