int getDistinctPairs(vector<int> stocksProfit, int target)
{  
    int n = stocksProfit.size();
  unordered_map<int, int> m;
  int count = 0;
  for (int i = 0; i < n; i++) {
    if (m.find(target - stocksProfit[i]) != m.end()) {
      count += m[target - stocksProfit[i]];
    }
    m[stocksProfit[i]]++;
  }
  return count;
}

Amazon(intern)✅

int solve(int m, int w) 
{ 
    if (m >= 1 && w >= 1) 
    { 
        int ways = m * (w * (w - 1)) / 2 + w * (m * (m - 1)) / 2; 
        return ways; 
    } 
    else 
    { 
        return 0; 
    }

IBM✅

vector<vector<int>> findOverlappingTimes(vector<vector<int>>& intervals) {
    if (intervals.empty()) {
        return {};
    }

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

    vector<vector<int>> merged;
    merged.push_back(intervals[0]);

    for (int i = 1; i < intervals.size(); i++) {
        if (merged.back()[1] >= intervals[i][0]) {
            merged.back()[1] = max(merged.back()[1], intervals[i][1]);
        } else {
            merged.push_back(intervals[i]);
        }
    }

    return merged;
}

Amazon (intern) ✅

Progress is hiring Software Engineer Intern

3 - 6 LPA

https://jobs.jobvite.com/careers/progress/job/ofbjufwX

#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✅