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✅

KPMG Hiring Software Engineer - Java

https://ejgk.fa.em2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/CX_1/requisitions/preview/INTG1009304?l

Company Name: HSBC

Role: Trainee Software Engineer

Batch eligible: 2022 and 2023 grads

Apply: https://mycareer.hsbc.com/en_GB/external/PipelineDetail/Trainee-Software-Engineer/204615?src=JB-257546

Word matching ✅

Amusement park code ✅

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define vc vector
#define L cout<<'\n';
#define E cerr<<'\n';
#define all(x) x.begin(),x.end()
#define rep(i,a,b) for (int i=a; i<b; ++i)
#define rev(i,a,b) for (int i=a-1; i>=b; --i)
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define setpr(x) cout<<setprecision(x)<<fixed
#define sz size()
#define seea(a,x,y) for(int i=x;i<y;i++){cin>>a[i];}
#define seev(v,n) for(int i=0;i<n;i++){int x; cin>>x; v.push_back(x);}
#define sees(s,n) for(int i=0;i<n;i++){int x; cin>>x; s.insert(x);}
const ll inf = INT_MAX;
const ld ep = 0.0000001;
const ld pi = acos(-1.0);
const ll mod = 1000000007;
int dp[1001][1001];
bool rem(ll a , ll b){return a%b;}
void init_code(){
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}
ll add(ll x, ll y){
   return (x+y)%mod;
}
ll multi(ll x , ll y){
   return (x*y)%mod;
}
ll power(ll x , ll y){
   x %= mod;
   ll res = 1;
   while(y > 0){
      if(y&1)res=multi(res,x);
      y=y>>1;
      x = multi(x,x);
   }
   return res;
}

ll inverse(ll n,ll p){
   return power(n,p-2);
}
int helper(unordered_map<int,vector<int>>&mp, vi &v,int ind,int prev){
   if(ind==v.size()) return 1;
   // cout<<ans
   if(dp[ind][prev]!=-1) return dp[ind][prev];
   int ans=0;
   for(auto it:mp[v[ind]]){
     if(it>prev)ans+=helper(mp,v,ind+1,it);
     ans%=mod;
   }
   return dp[ind][prev]=ans;
}
void solve(){
   int n;
   cin>>n;
   vi v(n);
   rep(i,0,n) cin>>v[i];
   unordered_map<int,vector<int>>mp;
   for(int i=1;i<=1000;i++){
         string s=to_string(i);
         int val=0;
         for(auto it:s){
            val+=it-'0';
         }
         mp[val].pb(i);
   }
   // vector<vector<int>>dp(1001,vector<int>(1001,-1));
   memset(dp,-1,sizeof(dp));
   cout<<helper(mp,v,0,0)<<endl;
}


signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
init_code();
   int t;cin >> t;while(t--)
   solve();
   return 0;
}

Finding Arrays
Google ✅