Lexicographical smallest substring - IBM ✅

Summer Internship positions for students at Bosch Corporate Research, India.
 
Domains: Text Analytics/NLP/Generative AI.
Duration: 2-6 months or more.
Responsibilities: Research activities on Natural Language Processing, Text Analytics, and Deep Learning
- Large Language Models
- RAG
- Domain Adaptation
- Knowledge Graphs
 
Qualifications: Current Bachelor / Master / Ph.D. students of Computer Science. Strong knowledge of Machine Learning, Deep Learning, and NLP. Interest and aptitude in research activities.
 
Interested candidates can send resumes at: 
- rtc_careers@in.bosch.com
- Subject: CR/RTC-IN: LLMs Internship - <name>, <college>, <degree_program (B.Tech/M.Tech./M.S/Ph.D.)>, <branch>, <graduation_year>
- e.g. CR/RTC-IN: LLMs Internship - Kartheek, IIT-H, M.Tech, CSE, 2025

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll count(ll k,vector<ll>&a,vector<ll>&b)
{
    ll n=a.size();
    ll m=b.size();
    unordered_map<ll,ll>mpp;
    ll ans=0;
    for(ll i=0;i<n;i++) mpp[__gcd(a[i],k)]++;
    for(ll i=0;i<m;i++)
    {
        for (auto &it:mpp)
            if((__gcd(b[i],k)*it.first)%k==0) ans+=it.second;
    }
        return ans;
}
signed main() 
{
    ll n,m,k; cin>>n>>m>>k;
    vector<ll>a(n),b(m);
    for(ll i=0;i<n;i++) cin>>a[i];
    for(ll i=0;i<m;i++) cin>>b[i];
    cout<<count(k,a,b);
    return 0;
}

Product divisibility ✅

Remote Intern Hiring

Hiring Process, Work at Rapidfort
https://youtu.be/aNBX-KbkWlE?si=KV9m_ogYy9KSIkFa

Societe Generale Off Campus Hiring Fresher For Analyst    
Location  : Bangalore  
Qualification   : Bachelor/Master Degree    
Work Experience : Fresher - 3 Years
CTC : 4.8 LPA    

Apply Link   : https://careers.societegenerale.com/en/job-offers/analyst-2400011N-en?src=JB-14381

LSEG is hiring Data Analyst!
Qualification: Bachelor's Degree
Entry level position

https://refinitiv.wd3.myworkdayjobs.com/Careers/job/IND-Bangalore-TowerERMZ-Infin/Data-Analyst_R0086415-1?

Hey all,

At Glance, we are looking for ML Interns, preferably studying Computer Science, to help us tackle problems using cutting edge Gen AI techniques - images & text both.

Location is Bangalore.

if this appeals to you do take a minute to fill this form - https://docs.google.com/forms/d/e/1FAIpQLSfCgZzFWGUmFT2JdPjoGiPq39S8PSpC5DalJ3I5o9az8dktKg/viewform

ZS is hiring for tech roles through ZS tech challenge - 2025 grads

https://app.joinsuperset.com/join/#/company/c0ca2554-565e-4d4d-b244-0cdfddda0bbc/competitions/a1e875ca-c51e-4049-970c-5046df2afd9a

Cyber Security Internship Opportunity

Location: IIT Kanpur

Position Type: Virtual

Duration: 1 Month

Skills Knowledge: Cybersecurity + Python + GenAI

Learnings:
1. Research on Cybersecurity Threats and Trends
2. Building Projects on Cybersecurity and AI
3. Learning basics to advanced skills in Python

Kindly submit the form: https://lnkd.in/gaCcGTVM

NOTE: Few Interns will be selected at IIT Kanpur for full-time internship with Cyber3ra

MAQ Hiring Software Engineer

https://forms.office.com/pages/responsepage.aspx?id=0o3Z5JmR5UK6i9o-dj7eLq0Di02SxiRKvrcmuY04xrFUQTlQM0tZNEpaQktGT09OUjJZOEhHSzNaNC4u

int main() {
    int n, x;
    cin >> n >> x;
    vector<int> c(n);
    for(int i = 0; i < n; i++) {
        cin >> c[i];
    }

    int m = 0, s = 0, i = 0;
    for(int e = 0; e < n; e++) {
        s += c[e];
        while(s > x) {
            s -= c[i++];
        }
        m = max(m, e - i + 1);
    }

    cout << m << endl;
    return 0;
}

Mercedes ✅

def maximize_profit(prices):
    if len(prices) < 2:
        return "Not Possible" 
    min_price = prices[0]
    max_profit = 0
    for price in prices[1:]:
        max_profit = max(max_profit, price - min_price)
        min_price = min(min_price, price)
    if max_profit > 0:
        return "Possible\n{}".format(max_profit)
    else:
        return "Not Possible"
n = int(input())
prices = list(map(int, input().split()))
print(maximize_profit(prices))

Maximize Profit ✅

# include <bits/stdc++.h>
using namespace std;
#define ll long long
signed main(){
    ll n; cin>>n;
    vector<ll>a(n);
    for(ll i=0;i<n;i++) cin>>a[i];
    ll x=0;
    for(ll i=0;i<n;i++) x^=a[i];
    ll ans=LONG_MAX;
    for(ll i=0;i<n;i++)  ans=min(ans,x^a[i]);
    cout<<ans<<endl;
    return 0;
}

Minimum Xor ✅