Company Name: Autodesk
Role: Software Development Engineer Intern
Eligibility: 2024 and 2025 grads

https://autodesk.wd1.myworkdayjobs.com/en-US/uni/job/Intern--Software-Development-Engineer--PDMS---D-M---Designing-_24WD84221

Hi All,
We, at Gartner, are hiring for Associate Services Business Analyst and Services Business Analyst for Gurugram location.

📌 Associate Services Business Analyst
- 0-3 years of overall experience in any related field
- Full-time graduation required
- Technical and non-technical backgrounds can apply

📌 Services Business Analyst
- 0-3 years of overall experience in any related field
- Full-time 2 years MBA/PGDM required
- Experience in strategies and business operations is an added advantage

NOTE: Candidates within the required experience range are encouraged to apply for the role.

Interested candidates can share their resume with me on garima.rai@gartner.com

Linkedin Coachin Program:

Graduation Year: 2027

Eligibility: Pursuing BE / BTech in CS / IT

Apply Link: https://linkedin.avature.net/linkedincoachin2025

Note: This is only for Female students.

Check out this job at Aptiv: https://www.linkedin.com/jobs/view/4114510902

Fresh Graduates from Mechanical or Electrical

https://app.greenhouse.io/embed/job_app?token=6433494&gh_src=be8ebc4b1&source=LinkedIn

2025 Batch Only


Apply using referral

Company: InfoEdge
Mega Hiring drive for 2022 and 2023 Batch
Apply: https://forms.office.com/r/eRfuETfXj5

https://docs.google.com/forms/d/e/1FAIpQLSeUR6t551yHbeh8RRp3lwWVb-t_eeZQwf_Lq3umF1In-osfrA/viewform

2024 and 2025 Batch

Company : Kenko AI
Eligible Batches : 2025, 2026 Graduates
Location : Bangalore 

👉🏻 Role : Frontend Intern
Apply Link : https://jobs.lever.co/bookeeapp/e6a00dd7-e949-456c-9ba2-c66eb98c3adb/

👉🏻 Role : Website Development Intern
Apply Link : https://jobs.lever.co/bookeeapp/8c515b6e-0681-4eb1-b629-314f6b960a31

https://docs.google.com/forms/d/e/1FAIpQLSfHixcqM1p-Ewl76lR9RD9dyMpYYxDDcbSvGSYS6w-zWjM9UQ/viewform'

#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;

int solution(const vector<int>& start, const vector<int>& dest, const vector<int>& limit) {
    int N = start.size();
    int K = limit.size();
    int totalCost = 0, maxStation = 0;

    for (int i = 0; i < N; ++i) {
        maxStation = max(maxStation, max(start[i], dest[i]));
        totalCost += abs(start[i] - dest[i]) * 2 + 1;
    }

    if (maxStation >= K) return -1; 
    return min(totalCost, limit[maxStation]);
}

MS Task 1✅

#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;

void dfs(int node, unordered_map<int, vector<pair<int, int>>>& graph, vector<bool>& visited, int& count) {
    visited[node] = true;
    for (auto& neighbor : graph[node]) {
        int nextNode = neighbor.first;
        int direction = neighbor.second;
        if (!visited[nextNode]) {
            count += direction;
            dfs(nextNode, graph, visited, count);
        }
    }
}

int solution(vector<int> A, vector<int> B) {
    unordered_map<int, vector<pair<int, int>>> graph;
    int N = max(*max_element(A.begin(), A.end()), *max_element(B.begin(), B.end())); 

    for (int i = 0; i < A.size(); i++) {
        graph[A[i]].push_back({B[i], 1});
        graph[B[i]].push_back({A[i], 0});
    }

    vector<bool> visited(N + 1, false);
    int count = 0;
    dfs(0, graph, visited, count);

    return count;
}

MS Task 2✅

https://pgagi.in/jobs/915877cd-a17f-4deb-9c0b-0c7eaf26968e

2025 and 2024 eligible