Bluecore is hiring Back-end Engineer

For 2021, 2022, 2023 grads
Location: Remote

https://www.bluecore.com/job-posting/?lever-source=LinkedIn&gh_jid=5074959004

def eulerTSieve(maxN):
    phi = list(range(maxN + 1))
    for i in range(2, maxN + 1):
        if phi[i] == i: 
            for j in range(i, maxN + 1, i):
                phi[j] -= phi[j] // i
    return phi

def coprimeCount(A):
    maxN = 10**5
    phiValue = eulerTSieve(maxN)
    
    return [phiValue[num] for num in A]

IBM  coprime ✅

Pencil Holder ✅
GE Healthcare

Dev community meetup - Bangalore
https://devcommunity-bangalore.splashthat.com/MOPS

Palindromes String
Mathwork ✅

def getValidWord(s, dictionary):
    def isSubSequence(word, string):
        it = iter(string)
        return all(c in it for c in word)
    
    validWords = [word for word in dictionary if isSubSequence(word, s)]
    
    if not validWords:
        return "-1"
    
    return min(validWords, key=lambda x: (len(x), x))

Glide typing ✅

def getAnagramPeriod(s):
    n = len(s)
    for i in range(1, n + 1):
        if n % i == 0:
            period = s[:i]
            if sorted(period * (n // i)) == sorted(s):
                return i
    return n

ION✅

vector<int> runningMedian(vector<int> arr) {
    priority_queue<int> low;
    priority_queue<int, vector<int>, greater<int>> high;
    vector<int> res;
   
    for (int num : arr) {
        low.push(num);
        high.push(low.top());
        low.pop();
        if (low.size() < high.size()) {
            low.push(high.top());
            high.pop();
        }
        res.push_back(low.top());
    }
    return res;
}

ION✅

Good News! Exciting news 📰

IT hiring to surge by around 8.5% next year

long equalize(vector<long> power){
    sort(power.begin(), power.end());
    int n = power.size();
    long mid = power[n/2];
    long res = 0;

    for(int i=0;i<n;i++){
        res += abs(power[i] - mid);
    }
    return res;
}

ION✅

Tcs offer our candidate 🔥

Freshers Eligible
Batch: 2022, 2023, 2024

Apply Now
hr@tvminfotech.com

#include <bits/stdc++.h>
using namespace std;
void aa(vector<vector<char>>& board) {
    int rows = board.size();
    int cols = board[0].size();
    for (int i = 0; i < rows; ++i) {
        int rightmost = cols - 1;
        for (int j = cols - 1; j >= 0; --j) {
            if (board[i][j] == '*') {
                rightmost = j - 1;
            } else if (board[i][j] == '#') {
                if (j != rightmost) {
                    board[i][rightmost] = '#';
                    board[i][j] = '-';
                }
                rightmost--;
            }
        }
    }
}

void bb(vector<vector<char>>& board) {
    int rows = board.size();
    int cols = board[0].size();

    for (int j = 0; j < cols; ++j) {
        int bottommost = rows - 1;
        for (int i = rows - 1; i >= 0; --i) {
            if (board[i][j] == '*') {
                bottommost = i - 1;
            } else if (board[i][j] == '#') {
                if (i != bottommost) {
                    board[bottommost][j] = '#';
                    board[i][j] = '-';
                }
                bottommost--;
            }
        }
    }
}
void pushBoxes(vector<vector<char>>& board) {
    aa(board);
    bb(board);
}

Databrick ✅