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

int stockLounge(vector<int> onHand, vector<int> supplier, int demand) {
    
    sort(onHand.begin(), onHand.end());
    sort(supplier.begin(), supplier.end());

    int totalSupplierUsed = 0;
    int n = onHand.size(), m = supplier.size();
    
   
    for (int i = 0; i < n; i++) {
        demand -= min(demand, 1);
    }

   
    for (int i = 0; i < m; i++) {
        if (demand > 0) {
            int canTake = min(supplier[i], demand);
            totalSupplierUsed += canTake;
            demand -= canTake;
        }
    }
    return totalSupplierUsed;
}

BNY Mellon ✅

https://t.me/crackingthecodinginterviews

Join this group for only interview Preparation 👍🏻

Hello Connections ! We are Hiring for Freshers in SOC ANALYST candidates who are interetsed for best placements in the IT firm .
Company : MID -LEVEL
Job Role : SOC Analyst
Tech stack : Cyber security
Experience : Fresher
Package : 3.6 Lpa
Location : Bangalore
Mode : WFH / WFO

Candidates should be proficient in the mentioned domain and should have a certification which is mandatory

Interested can share their resume on
Mail : hiring@shresthacloudsolutions.com
whatsapp : 9580192806
Mail : vikramshrestha1111@gmail.com

Company: Gain.pro
Location: Bangalore
Role: Web Developer
For Graduates: 2022, 2023, 2024

https://in.linkedin.com/jobs/view/web-developer-at-gain-pro-4001449490

def maxNewSort(N, demons):
    demons.sort(reverse=True)  
    ns = 0
    csu = 0
    for demon in demons:
        if csu < demon:
            ns += 1
            csu = 0
        csu += 1
    return ns

TVS Max New Swords

#include <bits/stdc++.h>
using namespace std;
bool ss(const vector<int>& A, const vector<int>& B, const vector<int>& C, int X) {
    unordered_set<int> possibleSums;
    for (int a : A) {
        for (int b : B) {
            possibleSums.insert(a + b);
        }
    }
        for (int c : C) {
        if (possibleSums.find(X - c) != possibleSums.end()) {
            return true;
        }
    }
    
    return false;
}

int main() {
    int N, M, L, Q;
     cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; ++i) cin >> A[i];
    cin >> M;
    vector<int> B(M);
    for (int i = 0; i < M; ++i) cin >> B[i];
    cin >> L;
    vector<int> C(L);
    for (int i = 0; i < L; ++i) cin >> C[i];
    cin >> Q;
    vector<int> queries(Q);
    for (int i = 0; i < Q; ++i) cin >> queries[i];
        for (int X : queries) {
        if (ss(A, B, C, X)) {
            cout << "Yes\n";
        } else {
        cout << "No\n";
        }
    }
    
    return 0;
}

TVS ✅

#include <bits/stdc++.h>
using namespace std;
bool comparePairs(const pair<int, int>& p1, const pair<int, int>& p2) {
    if (p1.first == p2.first) {
        return p1.second < p2.second;
    }
    return p1.first > p2.first;
}
int mergeAndSort(vector<int>& proce, vector<int>& support) {
    int n = proce.size();
    vector<pair<int, int>> merged;
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        merged.push_back({support[i], proce[i]});
        ans += proce[i];
    }
    sort(merged.begin(), merged.end(), comparePairs);
    ans = min(merged[0].first, ans);

    int curr = 0;
    for (int i = 1; i < n; ++i) {
        curr += merged[i - 1].second;
        ans = min(ans, max(curr, merged[i].first));
    }

    return ans;
}

CHUBB REAL TIME MESSAGING✅

public static int numDuplicates(List<String> name, List<Integer> price, List<Integer> weight) {
    int res=0;
    HashSet<String> set = new HashSet<String>();
    for(int i=0;i<name.size();i++){
        String cmb = name.get(i) + "_" + price.get(i)+ "_" + weight.get(i);
        if(set.contains(cmb)){
            res++;
        }
        else{
            set.add(cmb);
        }
    }
    return res;
    }
}

Chubb Dupilactes products✅

#include <bits/stdc++.h>
using namespace std;
double solve(int n, const vector<int>& prices) {
    vector<int> sorted_prices = prices;
    sort(sorted_prices.begin(), sorted_prices.end(), greater<int>());
        int keep_count = (4 * n) / 5;
        long long sum = 0;
    for (int i = 0; i < keep_count; ++i) {
        sum += sorted_prices[i];
    }
        return static_cast<double>(sum) / keep_count;
}

int main() {
    int n;
    cin >> n;
    vector<int> prices(n);
    
    for (int i = 0; i < n; ++i) {
        cin >> prices[i];
    }
    
    double result = solve(n, prices);
        cout << fixed << setprecision(5) << result << endl;
    
    return 0;
}

TVS✅

int n;
    cin >> n;
    vector<int> A(n);
    for (int i = 0; i < n; i++)
    {
        cin >> A[i];
    }
    int ans = 0;
    for (int i = 0; i < n - 1; ++i) {
        while (A[i] > A[i + 1]) {
            A[i] *= 2;
            ++ans;
        }
    }
    cout << ans << endl;

\\increasing array tvs✅

def ss(D, H, Mi, S, M, L, N):
    ww = (D * 24 * 60 * 60) + (H * 60 * 60) + (Mi * 60) + S
    
    s = M * L * N
    e = ww // s
    a = ww % s
    
    r = a // (L * N)
    a = a % (L * N)
    
    d = a // N
    q = a % N
    
    return e, r, d, q
D, H, Mi, S = map(int, input().split())
M, L, N = map(int, input().split())

ww = ss(D, H, Mi, S, M, L, N)
print(f"{ww[0]} {ww[1]} {ww[2]}  {ww[3]}")

TVS✅

Company Name: Urban Company
Role: SDE 1

Batch eligible: 2024 grads

Apply: https://docs.google.com/forms/d/1-ctraB4lJb2OHVDrqM1FZB3y5Tld1E9o3IyMKyurOVI/viewform