Company Name: Barclays

🛄 Job Title: Software Engineer

✍🏻 YOE: 2022 and 2023 grads


➡️ Apply: https://search.jobs.barclays/job/-/-/22545/64371653840?src=JB-12860

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

✈️ Exciting Opportunity with IndiGo (InterGlobe Aviation Ltd) in #Gurugram! ✈️

Join our team as a Customer Care Executive and be part of the dynamic aviation industry, where you'll have the chance to make a significant impact and grow both personally and professionally.

Key Responsibilities:
- Respond to customer complaints and queries via email and calls.
- Outcall customers to provide resolutions.
- Coordinate with other departments, especially Airport and Finance, to resolve customer issues effectively.
- Handle a high volume of customer queries and complaints via calls and emails.

Qualifications Required:
- Graduate
- 0-5 years of work experience in email and voice processes
- Strong written and verbal communication skills
- Flexible to work in rotational shifts and offs
- Previous experience in handling customer grievances via calls and email

Interview Rounds: Written & Face-to-Face Interview
Work Mode: Work From Office (On Site, 5 days a week)
Location: Gurgaon

Ready to embark on this journey with us? Send your CV to Ayushi.x.Jain@goindigo.in and let's soar together!

Note: Only suitable candidates will be approached. Thank you.

Company Name: Paypal

🛄 Job Title: Software Engineer
✍🏻 YOE: 2022 and 2023 grads


➡️ Apply: https://paypal.eightfold.ai/careers/job?domain=paypal.com&pid=274899699379&query=R0111290&domain=paypal.com&sort_by=relevance&job_index=0

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

Company Name: Qualcomm

🛄 Job Title: Software Engineer Intern
✍🏻 YOE: 2024 and 2025 grads

➡️ Apply: https://careers.qualcomm.com/careers/job?domain=qualcomm.com&pid=446693743471&query=intern&location=India&domain=qualcomm.com&sort_by=relevance&job_index=0

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

#include <bits/stdc++.h>

class WorkSchedule {
public:
    static void findSchedulesHelper(int workHours, int dayHours, const std::string& pattern, int index, int sum, std::string& current, std::vector<std::string>& schedules) {
        if (index == pattern.length()) {
            if (sum == workHours) {
                schedules.push_back(current);
            }
            return;
        }

        if (pattern[index] == '?') {
            for (int i = 0; i <= dayHours; i++) {
                current[index] = '0' + i;
                findSchedulesHelper(workHours, dayHours, pattern, index + 1, sum + i, current, schedules);
            }
            current[index] = '?';
        } else {
            findSchedulesHelper(workHours, dayHours, pattern, index + 1, sum + (pattern[index] - '0'), current, schedules);
        }
    }

    static std::vector<std::string> findSchedules(int workHours, int dayHours, const std::string& pattern) {
        std::vector<std::string> schedules;
        std::string current = pattern;
        findSchedulesHelper(workHours, dayHours, pattern, 0, 0, current, schedules);
        std::sort(schedules.begin(), schedules.end());
        return schedules;
    }
};

Work schedule ✅
Agoda

ZS campus beat code question - Generated Number

#include <iostream>
#include <vector>

using namespace std;

int totalChocolates(vector<int>& jars, int N) {
    int A = 0, B = 0, C = 0;
    for (int i = 0; i < N; ++i)
        A += jars[i];
        B += jars[++i % N];
        C += jars[++i % N];
    }
    return A;
}.  ZS campus beat code question - Chocolate 🌝 jar

class UserMainCode:
    @staticmethod
    def indexSort(input1, input2):
        uniq = set()
        for i in range(input1):
            if input2[i] != i + 1:
                uniq.add(input2[i])
        return input1 - len(uniq)

Index Sort✅

long getMaxCost(string s) {
    if (s.find('1') == string::npos) {
        return 0;
    }
    int ind = s.find('1');
    int count = 1;
    int n = s.length();
     long res = 0;
    int prev = ind;
   
    for (int i = ind + 1; i < n; ++i) {
        if (s[i] == '1') {
            if (prev != i - 1) {
                res += (i - prev) * count;
            }
            count += 1;
            prev = i;
        }
    }
   
    if (prev == n - 1) {
        prev = n;
    }
   
    return res + count * (n - prev);
}

Binary Circuit ✅

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long findInterestingPairs(vector<int>& arr, int sumVal) {
    sort(arr.begin(), arr.end());
    int val = sumVal / 2;
    long cc = 0;
    int ind = -1;
   
    for (int i = 0; i < arr.size(); ++i) {
        if (arr[i] == val) {
            cc++;
            if (ind == -1) {
                ind = i;
            }
        }
    }
   
    if (ind == -1) {
        return 0;
    }
   
    return ind * cc + ((cc - 1) * cc) / 2;
}.

De shaw 
Intersecting Pairs✅

while "AWS" in s:        s = s.replace("AWS", "")
        if not s:            return "-1"
    return s

Eliminate Substring ✅

Company Name: Accelya

🛄 Job Title: SDE 1

✍🏻 YOE: 2022 and 2023 grads


➡️ Apply: https://accelya.wd103.myworkdayjobs.com/en-US/Careers/job/Engineer-I---Software-Development_JR100382

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

Eliminate SubString ✅