Company Name: Bureau

Batch eligible: 2025 and 2026 grads

Role: Engineering Intern
Apply: https://jobs.bureau.id/?ashby_jid=7d547bf9-e182-4fbc-b026-d92093fe757a


Role: DevOps Intern
Apply: https://jobs.bureau.id/?ashby_jid=fc951ad0-bdd1-4b36-b354-e3f8964aabda

LTI Mindtree Candidate got interview mail 👍🏻

def getMaxTrafficTimes(start, end):
    n = len(start)
    start.sort()
    end.sort()
    ans, cmax, j = start[0], 1, 0

    for i in range(1, n):
        while end[j] < start[i]:
            j += 1
        if i - j + 1 > cmax:
            cmax = i - j + 1
            ans = start[i]

    return ans

MSCI getmaxtraffic Time ✅

#include <bits/stdc++.h>
using namespace std;
#define int long long

long triplets(long t, vector<int> d) {
    int n = d.size();
    long count = 0;

    sort(d.begin(), d.end());

    for (int i = 0; i < n - 2; ++i) {
        int j = i + 1;
        int k = n - 1;

        while (j < k) {
            int sum = d[i] + d[j] + d[k];
            if (sum <= t) {
                count += (k - j);
                ++j;
            } 
            else {
                --k;
            }
        }
    }

    return count;
}

MSCI Triplets ✅

SQL: Calendar Application Events Report 2(MSCI)✅

SELECT 
    e.dt,
    e.title,
    GROUP_CONCAT(CONCAT(g.full_name, ' <', g.email_address, '>') ORDER BY g.full_name SEPARATOR ', ') AS guests
FROM 
    events e
JOIN 
    events_guests eg ON e.id = eg.event_id
JOIN 
    guests g ON eg.guest_id = g.id
WHERE 
    g.on_vacation = 0
GROUP BY 
    e.id, e.dt, e.title
ORDER BY 
    e.dt ASC
LIMIT 5;

SELECT a.location, COUNT(f.flight_no) AS "Number of destination flights"
FROM airport a
JOIN flight f ON a.code = f.dest
GROUP BY a.location
HAVING COUNT(f.flight_no) > 0
ORDER BY COUNT(f.flight_no) DESC, a.location ASC;

AC flight sql✅

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✅