Ideaforge Hiring !!
Role - sde 1
Exp - fresher

https://app.webbtree.com/company/ideaforge/jobs/engineer-i---perception-systems-2dea7a

Company - AppAspect Technologies Pvt. Ltd.
Role - React Native Developer
Exp - 0-3 yrs
CTC - As per Experience
Location - Ahmedabad
This is a full time opportunity

Apply Link -
https://docs.google.com/forms/d/e/1FAIpQLSc1twjTS3c__lTaJJJJuS-AKpKxqVBnibHtxGZ6wrZVwjZ-2g/viewform

📌Walter P More is Hiring

Role: Application Developer Intern

💻Apply: https://careers-walterpmoore.icims.com/jobs/3393/job

https://www.linkedin.com/posts/ishika-goel-943708182_google-forms-sign-in-activity-7264636187661725696-tFP8?utm_source=share&utm_medium=member_desktop

Exciting Onsite Drive at Park+ - Apply Now!

We are hosting an onsite recruitment drive this Saturday, November 23rd, 2024, and we’re looking for talented B.Tech
candidates with at least 6 months of full-time experience for SDE-1/SDE-2 Backend Developer roles!

🔹 Key Details:
Role: SDE-1/SDE-2 Backend Developer
Date: Saturday, November 23rd, 2024
Location: Park+ Office (Onsite only, no virtual rounds) (Address: 5th floor, Tower-A, Unitech Cyber Park, Durga Colony, Sector 39, Gurugram, Haryana 122022)
Eligibility: B.Tech
graduates with at least 6 months full-time experience in backend development

Application Deadline: Form closes on November 21st, 2024, 12:00 PM

🔹 How to Apply:
Click on the link below to submit your application before the deadline!
Link: https://lnkd.in/gsjscnak


Shortlisted candidates will receive a time slot via email.
If you're available to come to the office and meet us in person this Saturday, don't miss this opportunity!

hashtag#Hiring hashtag#JobAlert hashtag#RecruitmentDrive hashtag#BackendDeveloper hashtag#SDE1 hashtag#SDE2 hashtag#OnsiteOpportunity hashtag#BTechJobs hashtag#TechJobs hashtag#ParkPlus hashtag#EngineeringJobs hashtag#JobOpportunity hashtag#CareerGrowth hashtag#ExperienceMatters

S&P Global is hiring Software Engineer

For 2025 grads
Location: Bangalore

https://careers.spglobal.com/jobs/309607?lang=en-us

int kadanes(vector<int> vs){
    int n=vs.size();
    int maxsum=INT_MIN;
    int sum=0;
    for(int i=0;i<n;i++){
        sum+=vs[i];
        maxsum=max(maxsum,sum);
        if(sum<0) sum=0;
    }
    return maxsum;
}


int solve(vector<int> vs,int impactfactor){
    int maxsum=kadanes(vs);
    return maxsum*impactfactor;
}

Amazon ✅

Company Name: Rupeek
Role: IT Intern
Batch: 2024 passouts

Apply Link: https://docs.google.com/forms/d/e/1FAIpQLSd4rVkUm5VEJQQNi4LWEI9NpUCyy6Ff8i45Q5ENiitVpTKDMQ/viewform

Note: Apply ASAP! It can get closed anytime soon.

Make Best use of this opportunity

Company name: Spyne
Role: SDE Intern
Batch Eligible: 2025 passouts
Location: Gurgaon, India
https://spyneai.keka.com/careers/jobdetails/45578

📌FIS Global Hiring Interns

Batch: 2025 Passouts

💻Apply Link: https://careers.fisglobal.com/us/en/job/JR0285527/Intern-IT-Trainee-FIS-University-Program-2025

📌Siemens is hiring!
Position: Graduate Trainee Engineer

Experience: Freshers
Location: Bangalore, India (Hybrid)

💻Apply Now: https://jobs.siemens.com/careers/job/563156121684879?microsite=siemens.com

long howManySwaps(vector<int> arr) {
    auto mergeAndCount = [](vector<int>& arr, int left, int mid, int right) -> long {
        vector<int> temp(right - left + 1);
        int i = left, j = mid + 1, k = 0;
        long swaps = 0;
        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                swaps += (mid - i + 1);
            }
        }
        while (i <= mid) temp[k++] = arr[i++];
        while (j <= right) temp[k++] = arr[j++];
        for (int p = 0; p < temp.size(); p++) {
            arr[left + p] = temp[p];
        }

        return swaps;
    };
    function<long(vector<int>&, int, int)> mergeSortAndCount = [&](vector<int>& arr, int left, int right) -> long {
        long swaps = 0;
        if (left < right) {
            int mid = left + (right - left) / 2;
            swaps += mergeSortAndCount(arr, left, mid);
            swaps += mergeSortAndCount(arr, mid + 1, right);
            swaps += mergeAndCount(arr, left, mid, right);
        }
        return swaps;
    };
    return mergeSortAndCount(arr, 0, arr.size() - 1);
}

Wayfair ✅

def solve(arr):
    arr.sort()
    n = len(arr)
    e = arr[n // 2]
    a = sum(abs(x - e) for x in arr)
    return a

Qulatech ✅

Company Name : Swiggy
Role : Associate Software Engineer
Batch : 2024/2023/2022 passouts

Link : https://docs.google.com/forms/d/1E029cjZV8Em6zPC0YJYAMDDP_NjPtDkwufqHfvkVG2E/viewform?edit_requested=true&pli=1