int pow2(long N) {
    int ans = 0;
    for (int i = 0; i < 64; i++) {
        long x = 1;
        if ((N & (x << i)) > 0) ans++;
    }
    return ans;
}

int minchunks(long total, vector<vector<long>> uploaded) {
   
    sort(uploaded.begin(), uploaded.end());

    int lastChunkNum = 1;
    int ans = 0;
    for (int i = 0; i < uploaded.size(); i++) {
        int start = uploaded[i][0];
        int end = uploaded[i][1];
        ans += pow2(start - lastChunkNum);
        lastChunkNum = end + 1;
    }

    if (uploaded.back()[1] != total) {
        ans += pow2(total - uploaded.back()[1]);
    }

    return ans;
}

C++✅

class Solution {
public:
    int lastStoneWeight(vector<int>& stones) {
        vector<int>vect(stones);
        int dum;
        for(int i=0; i<stones.size()-1; i++){
            sort(vect.begin(), vect.end());
            dum = vect[i]-vect[i+1];
            if(vect[i] != vect[i+1]){
                vect.erase(vect.begin());
                vect.erase(vect.begin());
                vect.insert(vect.begin(),dum);
            }
            else{
                vect.erase(vect.begin());
                vect.erase(vect.begin());
            }
       
        }
        if(!vect.empty()){
            return vect[0];
        }else{
            return 0;
        }
    }
};

Nivida ✅

Email ID - keerthana.jb@segulagrp.com

Today is very special day, as Bappa is coming❤️❤️, Happy Ganesh Chaturthi everyone

गणपति बप्पा मोरिया ✨🎊🎉❤️

Company Name: Zuddl

Role: iOS Intern

Batch eligible: 2023 and 2024 grads

Apply: https://zuddl.keka.com/careers/jobdetails/45874

Company Name : Directi

Role : Product Design Internship (UI/UX engineer)

Batch : 2024/2025 passouts

Link : https://jobs.lever.co/directi/cf481540-aa1b-46b0-bb73-96d0b8100a2d

int main() {
    int n, m;
    cin >> n >> m;

    vector<int> loads(n, 0);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> servers;

    for (int i = 0; i < n; ++i) {
        servers.push({0, i + 1});
    }

    for (int i = 0; i < m; ++i) {
        int request;
        cin >> request;

        auto min_server = servers.top();
        servers.pop();

        int server_index = min_server.second - 1;

        loads[server_index] += request;
        min_server.first += request;

        servers.push(min_server);

        cout << min_server.second << " ";
    }

    cout << endl;
    return 0;
}

Server ✅
Amadeus

import math
from bisect import bisect_left, bisect_right

mx = 10**6

spf = [False, False] + [True for i in range(mx)]

for i in range(2, int(math.sqrt(mx)) + 1):
    if spf[i] == True:
        for j in range(i * i, mx + 1, i):
            spf[j] = False

p = []

for i in range(len(spf)):
    if spf[i]:
        p.append(i)

p.sort()
n = len(p)
cnt = 0

N = int(input())

idx = bisect_right(p, N)

a = []

for i in range(1, idx):
    z = 2 ** p[i]
    if (2 < p[i] < z or 2 < z < p[i]) and z <= N:
        cnt += 1
        a.append([2, p[i], 2])

print(cnt)

Mystery keys ✅

Plivo is hiring SDE - 1

Batch -  2022/2023 Grads

Expected CTC: 25-30 LPA

Apply - https://jobs.lever.co/plivo/603bbc5e-77ad-4d8c-9b4b-9d16fecc04ec/

Teksystem is Hiring !!

Role: Java Developer- Freshers

CTC: 6-10 LPA

Experience: 0-3 Years

Location: Delhi

Apply here-
https://jobs.en-in.teksystems.com/l/recruiting/jobapplication/45fe8dd5-40e6-11ee-9bfd-42010a8a0ff7/b6d93e3c-56af-11ee-a306-42010a8a0fd9/false?step=1

def solve(N, A, B):
    set_B = set(B)
    smallest_missing = None
    for num in A:
        if num not in set_B:
            if smallest_missing is None or num < smallest_missing:
                smallest_missing = num
   
    if smallest_missing is None:
        return -1
   
    return smallest_missing

Missing Element ✅

GFG Jobathon 22 - 10+ startups are hiring 🔥

https://bit.ly/GFGJobathon22

Delete TV Channels (HSBC)✅

Counting Analogous Arrays
Python 3✅