Flipkart Grid Challenge - Internship & PPO
Eligibility: 2026, 2027, 2028 & 2029 Graduates
Internship Stipend: Upto INR 1 Lacs per month
SDE-1 Role Compensation: Upto NR 32 LPA
Cash Prizes worth INR 6 Lakhs

Apply link :

https://mycareernet.in/mycareernet/contests/Flipkart-Flipkart-GRiD-7-0--234

company name: trellix
role: software apprentice(12 months)
batch: 2025/24 passouts
cgpa: 7.5 and above
Link: https://trellix.wd1.myworkdayjobs.com/EnterpriseCareers/job/India-Bangalore/Software-Engineer---Apprentice_JR0035845-1

company name: amazon
batch: 2024/23 passouts
role: sde-1

Link to apply: https://www.amazon.jobs/en/jobs/2976299/sde-1

company name: electrolux group
batch: 2025/2024 passouts
role: junior frontend engineer
Link: https://career.electroluxgroup.com/global/en/job/EISAGLOBALJR70752EXTERNALENGLOBAL315194/Junior-Frontend-Engineer

Company: FinacPlus
Role - Frontend Intern
Stipend - 50K per month
Experience - Freshers
Duration: 6 Months + Chance of PPO
Batch: 2025 passouts
- HTML, CSS, JavaScript, React Js
- Git, GitHub

Send resumes at Email resume@finacplus.com

Hinge Health is hiring Software Engineering Intern

Experience: 0 - 1 year's
Expected Salary: 6 LPA (Expected)

Apply here: https://careers.hingehealth.com/jobs/2143/job?iis=Job%20Board&iisn=Indeed&indeed-apply-token=73a2d2b2a8d6d5c0a62696875eaebd669103652d3f0c2cd5445d3e66b1592b0f


PayU is hiring for Associate Software Engineer

Experience: 0 - 1 year's
Expected Salary: 6 - 10 LPA

Apply here: https://careers.payu.in/PayU/job/Bengaluru-Associate-Software-Engineer/3154380/


Calix is hiring for Graduate Trainee

Experience: 0 - 1 year's
Expected Salary: 5 - 7 LPA

Apply here: https://calix.wd1.myworkdayjobs.com/en-US/ExternalInternational/job/Bangalore/Graduate-Trainee_R-10621?mode=job&iis=Indeed&iisn=Indeed.com

https://vinsol.hire.trakstar.com/jobs/fk0h3g/

2025 Batch only ✅

using namespace std;

#define ll long long

int main() {
    int numBombs;
    cin >> numBombs;

    vector<pair<int, int>> bombTimers(numBombs);
    for (int i = 0; i < numBombs; i++)
        cin >> bombTimers[i].first >> bombTimers[i].second;

    sort(bombTimers.begin(), bombTimers.end(), [](const auto &a, const auto &b) {
        return a.second < b.second;
    });

    ll currentTime = 0;
    for (int i = 0; i < numBombs; i++) {
        currentTime += bombTimers[i].first;
        if (currentTime > bombTimers[i].second) {
            cout << -1 << endl;
            return 0;
        }
    }

    cout << currentTime << endl;
    return 0;
}

UBER ✅