Company Name: Stripe

Role: Software Engineer

Batch eligible: 2023 and 2024 grads

https://stripe.com/jobs/listing/software-engineer-new-grad/6172694

Cisco Referral (summer internship)

Role: Software Engineer – Network/Embedded/Application Development (Intern) - India UHR

Eligibility: candidates graduating in 2026

Deadline : 25 Aug 2024, 11 : 11 AM

Apply Here : https://forms.gle/jsxv2HmYYxsjmep69

Spinney is hiring for Business Analyst

Skills : Excel , SQL , Python

Send resume : praful.jain@spinny.com

Freecharge is hiring Full Time Software Engineer Intern

Send resume : mansi.jaggi@freecharge.com

PESU Venture Labs (PVL) is hiring Flutter Developer

CTC : 6 - 12 LPA
Location : Bangalore

Apply Here : https://forms.gle/zZaRkxuMYF7GE7pN9

Amplelogic is hiring Interns, come on freshers don't miss this wonderful opportunity, share your CVS to thejaswini.c@amplelogic.com

Position : Devops interns (B tech fresher who got trained in devops only can apply)

Location : Hyderabad(onsite)

Note : based on the performance the internship will be converted to full time employment.

Capgemini is hiring for Fresher Data Engineer role

2024/2023/2022 passouts eligible

Apply now : https://careers.capgemini.com/job/Bangalore-Data-Engineer-0-to-2-years-Bengaluru/1111499501/?feedId=388633&utm_source=CareerSite&tcsource=apply

AXL Hiring !!
Role - Associate Software Engineer


https://careers.axa.com/global/en/job/AXGRGLOBAL13004705D20240620MYHRTALEOENEXTERNALENGLOBAL

Fresher Hiring
https://forms.office.com/pages/responsepage.aspx?id=hlwIE8tLCkam8LNzQhxjI0fnhOF39rxFtjIbLxccLeVUQ1I1QUhGUVkwTVo5Rlc1SldKTzBMT0kyVi4u&route=shorturl

def solution(a, b):
    def iDigit(s1, s2, i):
        d1 = int(s1[-i]) if i <= len(s1) else 0
        d2 = int(s2[-i]) if i <= len(s2) else 0
        return d1 + d2

    result = []
    maxL = max(len(a), len(b))
    
    for i in range(1, maxL + 1):
        result.append(str(iDigit(a, b, i)))
    
    return ''.join(result[::-1])

Visa ✅

vector<int>solution(vector<vector<int>>lamps,vector<int>points)
{
    map<int,int>mp;
    for(auto &ele:lamps)
    {
        mp[ele[0]]++;
        mp[ele[1]+1]--;
    }
    map<int,int>temp;
    int ct=0;
    for(int i=1;i<=1e5+1;i++)
    {
        ct+=mp[i];
        temp[i]=ct;
    }
    vector<int>ans;
    for(int i=0;i<points.size();i++)
    {
        ans.push_back(temp[points[i]]);
    }
    return ans;
}

Visa ✅

vector<int> solution(vector<vector<int>>& lamps, vector<int>& points) {
   
    vector<pair<int, int>> events;
    for (const auto& lamp : lamps) {
        events.push_back({lamp[0], 1});  
        events.push_back({lamp[1] + 1, -1}); 
    }
    
    
    sort(events.begin(), events.end());
    vector<pair<int, int>> indexed_points;
    for (int i = 0; i < points.size(); ++i) {
        indexed_points.push_back({points[i], i});
    }
    sort(indexed_points.begin(), indexed_points.end());

    vector<int> result(points.size());
    int active_lamps = 0;
    int event_index = 0;

    
    for (const auto& [point, index] : indexed_points) {
        while (event_index < events.size() && events[event_index].first <= point) {
            active_lamps += events[event_index].second;
            ++event_index;
        }
        result[index] = active_lamps;
    }

    return result;
}

Visa ✅