๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.7K 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
bool isMatch(string& text, string& pat) {
    int textLen = text.length();
    int patLen = pat.length();

    if (patLen != textLen) {
        return false;
    }

    for (int i = 0; i < textLen; ++i) {
        if (pat[i] != '*' && pat[i] != text[i]) {
            return false;
        }
    }

    return true;
}

vector<string> matchStrings(vector<string> text, vector<string> pat) {
    vector<string> result;

    for (int i = 0; i < text.size(); ++i) {
        if (isMatch(text[i], pat[i])) {
            result.push_back("YES");
        } else {
            result.push_back("NO");
        }
    }

    return result;
}

//Amazon Qs 1โœ…
int solve(vector<int> a, vector<int> b) {
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    int c = 0;
    for (int i = 0; i < a.size(); i++) {
        c += abs(a[i] - b[i]);
    }

    return c;
}

Amazon โœ…
def findMinimumOperations(boxes):
    total_boxes = sum(boxes)
    average_boxes = total_boxes // len(boxes)

    extra_piles = total_boxes % len(boxes)

    operations = 0

    for box_count in boxes:
        difference = box_count - average_boxes

        if difference > 0:
            operations += difference
           
            if extra_piles > 0:
                operations -= 1
                extra_piles -= 1

    return operations

Amazon โœ…
#include<bits/stdc++.h>
using namespace std;

bool check(vector<int>& v) {
    for(int i = 1; i < v.size(); i++) {
        if(v[i] % 2 == v[i-1] % 2) return false;
    }
    return true;
}

void solve(int n) {
    vector<int> v(n);
    iota(v.begin(), v.end(), 1);
    do {
        if(check(v)) {
            for(int i = 0; i < n; i++) {
                cout << v[i] << " ";
            }
            cout << "\n";
        }
    } while(next_permutation(v.begin(), v.end()));
}

int main() {
    int n;
    cin >> n;
    solve(n);
    return 0;
}

Meesho โœ…
JOB OPENING UPDATE

Company โ€“ Outscal
Role โ€“ Data Analyst
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3808136260

Company โ€“ MobileWorld Vadodara
Role โ€“ Data Analyst
Exp. โ€“ Fresher or 2yrs
Apply Here โ€“ https://www.simplyhired.co.in/job/v2EOhk9tHARNM976W87UDNj2NssxTDuVy4UnYtenuzJ_w2NXNEdLDA

Company โ€“ Virtusa
Role โ€“ Data Engineer
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3807584624

Company โ€“ Bureau
Role โ€“ Data Engineering Intern
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3807286769

Company โ€“ MedTourEasy
Role โ€“ Data Analysis Trainee
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3808140227

Company โ€“ Energy Alternatives India
Role โ€“ AI For Climate Research
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/detail/ai-for-climate-research-internship-in-chennai-at-energy-alternatives-india1705387859?utm_source=cp_link&referral=web_share

Company โ€“ Faclon
Role โ€“ Data Science Intern
Exp. โ€“Fresher
Apply Here โ€“ https://internshala.com/internship/detail/data-science-internship-in-mumbai-at-faclon1705298889?utm_source=cp_link&referral=web_share

Company โ€“ Binford Research Labs pvt ltd
Role โ€“ Artificial Intelligence
Exp. โ€“ Fresher
Apply Here โ€“ https://www.simplyhired.co.in/job/rWGTWDvTRKMxe6aIlevL06tZYOHLxlzInjBkq4DPUmZtUpE2LE1JCA
Amazon India Hiring

Amazon Web Services - AWS is hiring for Cloud Support Associate (CSA). As a CSA, you'll solve customer cases using advanced troubleshooting techniques, providing tailored solutions and driving customer interactions.

Permanent WFH - Work From Home. Good Work Life Balance. Good pay.

What qualifications/skills are we looking for?
- Bachelorโ€™s Degree in Engineering or MCA - 2023 Graduates ONLY
- 0-1 years of experience in Linux/Windows Systems administration OR Database design and Optimization OR BigData Analysis OR Network administration OR Dev-ops. (no relevant experience also works but would be a plus)

Job link - https://amazon.jobs/en/jobs/2469306/cloud-support-associate

P.S. - You would be tested on your Computer Networking & Operating Systems concept (the college subjects, yes). So, if you are proficient with the same. It would be a cake walk to clear the interviews.
class DNSCache:
    def init(self, cache_size, cache_time):
        self.cache_size = cache_size
        self.cache_time = cache_time
        self.cache = {}

    def get_from_cache(self, url):
        if url in self.cache:
            return self.cache_time
        return -1

    def add_to_cache(self, url):
        if len(self.cache) == self.cache_size:
            oldest = min(self.cache, key=self.cache.get)
            del self.cache[oldest]

        self.cache[url] = 1


def calculate_min_time(urls, dns_cache, server_time):
    result_times = []

    for url in urls:
        cache_time = dns_cache.get_from_cache(url)

        if cache_time != -1:
            result_times.append(cache_time)
        else:
            result_times.append(server_time)
            dns_cache.add_to_cache(url)

    return result_times

IBM โœ…
n = len(a)
I = int(sum(a) / n)
p = int((sum(a) / n - I) * n)
a = sorted(a)
ans = 0

for i, x in enumerate(a):
    if i < n - p:
        ans += abs(a[i] - I)
    else:
        ans += abs(a[i] - I - 1)

ans = int(ans / 2)
print(ans)

Amazon โœ…
#include <bits/stdc++.h>
using namespace std;

void solve(vector<int>& arr) {
    set<int> uniqueElements(arr.begin(), arr.end());
    long long sum = 0;

    for (int elem : uniqueElements) {
        sum += (1LL << elem);
    }

    cout << sum << endl;
}

int main() {
    vector<int> arr = {1, 2, 3, 2, 1};
    solve(arr);

    return 0;
}

Walmart โœ…
from collections import Counter

def get_max_common_str_len(strs):
    counters = [Counter(s) for s in strs]
    result = 0
    for i in range(26):
        letter = chr(ord("a") + i)
        freq = float("inf")
        for counter in counters:
            if counter[letter] < freq:
                freq = counter[letter]
        result += freq

    return result

Walmart โœ