MAQ Hiring !!
Role - Developer
Exp - 0 year

Link - https://forms.office.com/r/eaWWtnuMx7

NatWest Group is hiring Data Analytics Associate!

📝 Qualification: Bachelor's degree

🎯 Experience: Freshers

📍 Location: Chennai

https://jobs.natwestgroup.com/jobs/14769420-data-and-analytics-associate?bid=370

string largestMagical(string binString) {
    if (binString.empty()) return binString;
    vector<string> ans;
    int cnt = 0, j = 0;
    for (int i = 0; i < binString.size(); ++i) {
        cnt += binString[i] == '1' ? 1 : -1;
        if (cnt == 0) {
            ans.push_back("1" + largestMagical(binString.substr(j + 1, i - j - 1)) + "0");
            j = i + 1;
        }
    }
    sort(ans.begin(), ans.end(), greater<string>());
    return accumulate(ans.begin(), ans.end(), string{});
}

Nvidia (intern) ✅

#include <stdio.h>
#include <regex.h>
int isPowerOfTwo(const char *binaryString) {
    regex_t regex;
    int result;
    result = regcomp(&regex, "^0*10*$", REG_EXTENDED);
    if (result) {
        printf("Could not compile regex\n");
        return 0;
    }
    result = regexec(&regex, binaryString, 0, NULL, 0);
    regfree(&regex);
    if (!result) {
        return 1;
    } else {
        return 0;
    }
}

int main() {
    int t;
    char binaryString[1000]; 
    scanf("%d", &t);
    while (t--) {
        scanf("%s", binaryString);
        if (isPowerOfTwo(binaryString)) {
            printf("True\n");
        } else {
            printf("False\n");
        }
    }

    return 0;
}

Nvidia ✅

https://leetcode.com/discuss/interview-question/645247/Toptal-or-OA-2020-or-Biggest-Integer-in-a-Matrix  task 3

Amex ✅

Batch 2023/2024

https://docs.google.com/forms/d/e/1FAIpQLSdQ-NzcoWBahQyqn_8fpL0DEWxmN1pu5F8RbRuPw2PY6qks6Q/viewform?pli=1

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

const int MOD = 1e9 + 7;

using namespace std;

long long solve(const vector<int>& a, int b) {
    int c = a.size();
    long long d = 0;
    for (int i = 0; i < c; i++) {
        d += a[i];
    }

    vector<long long> e(b + 1, 0);
    e[0] = 1; 

    for (int i = 0; i < c; i++) {
        for (int j = b; j >= a[i]; j--) {
            e[j] = (e[j] + e[j - a[i]]) % MOD;
        }
    }
    long long f = 1;
    for (int i = 0; i < c; i++) {
        f = (f * 2) % MOD;
    }

    long long g = 0;
    for (int i = 0; i <= b; i++) {
        g = (g + e[i]) % MOD;
    }

    long long h = (f - 2 * g + MOD) % MOD;
    return h;
}

Sum of the elements ✅
Oyo

def solve(n, m, arr):
    mod = 10**9 + 7
    fact = [1] * (n + 1)
    for i in range(2, n + 1):
        fact[i] = fact[i - 1] * i % mod

    arr.sort()
    if n == 1:
        return 1

    val = arr.pop()
    arr[-1] += val

    def mod_inverse(a, mod):
        return pow(a, mod - 2, mod)
    
    ans = fact[n]
    temp = 1
    for count in arr:
        temp = (temp * fact[count]) % mod
    
    temp = mod_inverse(temp, mod)
    return (ans * temp) % mod

minimum arrangements ✅
Oyo

Company Name : Google
Batch : 2025 passouts
Role : Software Engineer - University Grad

Link : https://www.google.com/about/careers/applications/jobs/results/142576465748075206-software-engineer/

📌We are hiring for Network Engineers..

Location - Kochi and Bangalore
Qualification - Graduate and CCNA Certified
Experience - Only Freshers

Interested candidates please share your resume on ankita.thakur@intertouch.com

#include <iostream>
#include <vector>
using namespace std;

const int MOD = 1e9 + 7;

class SegmentTree {
    int n;
    vector<long long> t;
    bool isSum;

public:
    SegmentTree(const vector<int>& v, bool sum) : n(v.size()), isSum(sum) {
        t.resize(2 * n, sum ? 0 : 1);
        for (int i = 0; i < n; ++i) {
            t[i + n] = v[i];
        }
        for (int i = n - 1; i > 0; --i) {
            t[i] = isSum ? (t[2 * i] + t[2 * i + 1]) % MOD : (t[2 * i] * t[2 * i + 1]) % MOD;
        }
    }

    long long query(int l, int r) {
        long long res = isSum ? 0 : 1;
        l += n;
        r += n;
        while (l < r) {
            if (l & 1) {
                res = isSum ? (res + t[l]) % MOD : (res * t[l]) % MOD;
                ++l;
            }
            if (r & 1) {
                --r;
                res = isSum ? (res + t[r]) % MOD : (res * t[r]) % MOD;
            }
            l /= 2;
            r /= 2;
        }
        return res;
    }
};

vector<long long> HardQueries(int n, const vector<int>& v, int q, const vector<vector<int>>& queries) {
    vector<long long> ans;
    SegmentTree sumTree(v, true);
    SegmentTree prodTree(v, false);

    for (const auto& x : queries) {
        int type = x[0], a = x[1] - 1, b = x[2];
        vector<int> indices;
        for (int i = a; i < n; i += b) {
            indices.push_back(i);
        }

        if (type == 0) {
            long long res = 0;
            for (int idx : indices) {
                res = (res + sumTree.query(idx, idx + 1)) % MOD;
            }
            ans.push_back(res);
        } else if (type == 1) {
            long long res = 1;
            for (int idx : indices) {
                res = (res * prodTree.query(idx, idx + 1)) % MOD;
            }
            ans.push_back(res);
        }
    }

    return ans;
}

queries and fruits✅

Company Name: Optum
Role: Software Engineer
Batch eligible: 2023 and 2024 grads

Apply: https://careers.unitedhealthgroup.com/job/21243748/software-engineer-hyderabad-in

Company Name: Zebra Technology
Role: Software Engineer 1
YOE: 0-2 years

Apply: https://zebra.eightfold.ai/careers/job?domain=zebra.com&pid=343623229683&domain=zebra.com

Company Name : UKG
Batch : 2024 passouts
Role : SDE Internship

Link : https://apply.ukg.com/careers/job?domain=ukg.com&pid=893379164769&domain=ukg.com&sort_by=relevance&job_index=0

Company Name : Meesho
Batch : 2024/2023 passouts
Role : SDE1

Link : https://docs.google.com/forms/d/e/1FAIpQLScESUZ3QSePda-W4tpRQh3jYgI5l5LqvdzscXosghfVTOgvNA/viewform?pli=1

Will be closed soon, fill asap.