๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.67K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
Hindustan Unilever Limited is looking for CA Industrial Trainees who have 15-18 months of training remaining
Work Location - Bengaluru (Hybrid Mode).

Key Skills looking for..

- In-depth Accounting knowledge
- Ability to work with senior stakeholders
- Excellent Communication skills
- High on attention to detail
- Strong problem solving and analytical skills
- Advanced Excel skills

Stipend - INR 30K per month
Exam Leaves -3 Months (Fully Paid)

Please fill the below google form to apply.

https://docs.google.com/forms/d/e/1FAIpQLSfWAuvGFaAQBHMddBH6ainJbHCd8holWzHNdk2oxdISDwvM_w/viewform
๐ŸŒŸ Exciting Opportunity Alert! ๐ŸŒŸ

We are seeking a junior QA engineer with 0โ€“1 year of experience, who is eager to learn and contribute to our dynamic team.
 
If you're passionate about quality assurance and ready to take on new challenges, we would love to hear from you.
 
Location- Thane, Mumbai (Work from office ๐Ÿ’ผ ).
Interested candidates can share their resumes at Riddhi.s@sankeysolutions.com.
โœˆ๏ธ 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.
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
Photo
#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
#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โœ