𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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✅

862 views13:16

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

661 views13:20

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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 ✅

900 views14:11

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Pencil Holder ✅
GE Healthcare

970 views14:26

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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

Splashthat

Dev community meetup - Bangalore

Come mingle with fellow developers, exchange ideas, and build valuable connections.

569 views16:01

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Palindromes String
Mathwork ✅

844 views16:06

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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 ✅

825 views16:07

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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✅

👍1

813 views16:31

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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✅

815 views16:34

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

Good News! Exciting news 📰

IT hiring to surge by around 8.5% next year

👍1

776 views16:39

𝗖𝗦 𝗔𝗹𝗴𝗼 💻 🌐 『𝗖𝗼𝗺𝗽𝗲𝘁𝗶𝘁𝗶𝘃𝗲 𝗣𝗿𝗼𝗴𝗿𝗮𝗺𝗺𝗶𝗻𝗴』

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✅

813 views18:02