IIT Ropar is conducting a special Entrance Test for AI Minor Degree

Test is on this Sunday:
https://bit.ly/test-ai-minor

https://www.linkedin.com/posts/-divya-porwal_internshipalert-techcareers-softwareengineering-activity-7258033652498866177-J7lu?utm_source=share&utm_medium=member_desktop

2025 and 2026 Batch

Form Link: https://forms.gle/G1oFMrDmi8rpB8xv8

int findmaximumPackages(vector<int>&arr)
{
    int n = arr.size();
    int mx = *max_element(arr.begin(), arr.end());
    mx = mx * 2;
    int res = 0;
    map<int, int>mp;
    for (auto it : arr) {
        mp[it]++;
    }
    for (int i = 1; i <= mx; i++) {
        int sm = 0;
        for (int j = 1; j <= (i - 1) / 2; j++) {
            sm += min(mp[j], mp[i - j]);
        }
        if (i % 2 == 0) {
            sm += (mp[i / 2] / 2);
        }
        res = max(res, mp[i] + sm);
    }
    return res;
}

Amazon ✅

sort(memory.begin(), memory.end(), greater<int>());
long sum = 0, ans = 0;
for(int x: memory) {
sum += x;
ans += sum;
}
return ans;

Amazon ✅

Guys it will take time but it will happen!

#include <bits/stdc++.h>
using namespace std;
unordered_map<string, long> g(vector<string>& w) {
    unordered_map<string, long> m;
    for (const string& x : w) {
        string y = x;
        sort(y.begin(), y.end());
        m[y]++;
    }
    return m;
}
vector<long> substitutions(vector<string>& w, vector<string>& p) {
    unordered_map<string, long> m = g(w);
    vector<long> r;
    for (const string& q : p) {
        stringstream ss(q);
        string z;
        long c = 1;
        while (ss >> z) {
            string t = z;
            sort(t.begin(), t.end());
            c *= m[t];
        }
        r.push_back(c);
    }

#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> msk(1024,-1);
void digits(ll num1) {
    string str1 = to_string(num1);
    set<ll>s;
    for (char digit : str1) {
        ll d=digit-'0';
        s.insert(d);
    }
    ll val=0;
    for(auto it:s) val+=(1<<it);
    msk[val]=max(msk[val],num1);
}

ll solution(vector<ll>& A) {
    for(auto &it:msk) it=-1; 
    ll ans=-1;
    for(auto it:A) digits(it);
    for(ll i=1;i<1024;i++){
        if(msk[i]==-1) continue;
        for(ll j=i+1;j<1024;j++){
            if(msk[j]==-1) continue;
            ll fl=0;
            for(ll k=0;k<10;k++){
                if((1<<k)&i){
                    if((1<<k)&j){
                        fl=1;
                        continue;
                    }
                }
            }
            if(fl) continue;
            ans=max(ans,msk[i]+msk[j]);
        }
    }
    return ans;
}

Microsoft ✅

def arrayMaxima(n,a):
    evens, odds = [], []
    for x in a:
        if x % 2 == 0:
            evens.append(x)
        else:
            odds.append(x)
    
    x = max(evens) - min(evens)
    y = max(odds) - min(odds)
    
    return x + y

EY ✅

def minimizeeffort(e):
    n = len(e)
    e.sort()
    m = {}
    s = 0
    for i in range(n):
        c = e[i]
        min_effort = c
        for d in range(1, int(c**0.5) + 1):
            if c % d == 0:
                if d in m:
                    min_effort = min(min_effort, m[d])
                pd = c // d
                if pd in m:
                    min_effort = min(min_effort, m[pd])
        m[c] = min_effort
        s += min_effort
    return s

Amazon ✅

FamPay is hiring for Backend Engineering Intern
Expected Stipend: 4-8 LPA
Apply here: https://jobs.lever.co/fampay/d9d56021-db58-452b-a1d4-8d3f5269e4cb

def solution(S, K):
    n = len(S)
    if K == 0:
        return compressLength(S)

    res = float('inf')
    for i in range(n - K + 1):
        newS = S[:i] + S[i + K:]
        res = min(res, compressLength(newS))
    
    return res

def compressLength(s):
    n = len(s)
    if n == 0:
        return 0
    count = 1
    length = 0
    for i in range(1, n):
        if s[i] == s[i - 1]:
            count += 1
        else:
            length += 1 + (len(str(count)) if count > 1 else 0)
            count = 1
    length += 1 + (len(str(count)) if count > 1 else 0)
    return length

Microsoft ✅

T* extendT(T* node) {
    if (!node) return node;

    if (!node->l && !node->r) {
        node->l = new T(node->x,nullptr,nullptr);
        node->r = new T(node->x,nullptr,nullptr);
    } else {
        extendT(node->l);
        extendT(node->r);
    }
    return node;
}

Microsoft ✅

Company: BreakoutAI
Role: Artificial Intelligence Intern

Batch: College Students any branch
Stipend : 20k to 50k / Month 
https://unstop.com/internships/artificial-intelligence-internship-breakoutai-1201230

https://forms.office.com/Pages/ResponsePage.aspx?id=t0kr1Y8MiU2MT_IFFzBuCG7YMV2ZxhhHtHMDc1sYGY5UQllaQ0JCOEZTNU1FNlVBQUw4VjVLTlNDMi4u&origin=QRCode

Mumbai preferred

Urgent Requirement for Data Analyst (Remote Work) with 0 to 2 years of experience in Data Analysis!

We are looking for candidates skilled in data collection, data cleaning, and analysis. The ideal candidate should be proficient in SQL, Excel, and have experience with data visualization tools (e.g., Tableau, Power BI) for generating insights based on business requirements. Knowledge of Python for data processing and basic analytics is a plus. https://cuvette.tech/app/public/internship/6724c1739a0d4bfd171c353c

We have a few internship positions (immediate requirement) in our team at Siemens Technology. We are the internal R&D division of Siemens and our team focuses on decentralized architecture and ecosystems.

Internship timeline:
2-3 months, can be extended depending upon performance and availability

Technical skills required (would be good to have at least a few):
1. Docker
2. Kubernetes
3. Rust (preferred but not mandatory)
4. Linux

Highest priorities to 1, 2, and 4.

Please be aware that only college students are eligible for consideration, and we are specifically seeking individuals who have completed their third year. 
Freshers will not be considered for internship positions.

Interested candidates, please fill the following form:

https://forms.office.com/Pages/ResponsePage.aspx?id=zTuuOHmV1E-t2rQuFJXVWt0CbIp3V6BHj35WsHO_dtlURDQ5NEw2VldQQ0Y5TjZTNkdTNU5JMlYwMC4u