def noOfProducts(order,disAmount):
    c=0
    for i in order:
        if i>0 and disAmount%i==0:
            c=c+1
    return c

Number of Products ✅
SAP

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(),x.end()
int main(){
  IO;
  ll n, m;
    cin>>n>>m;
    vector<pair<ll, ll>>A;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            ll x;
            cin>>x;
            A.pb({x , i});
        }
    }
   
    sort(all(A));
    unordered_map<ll ,ll>mp;
    ll l1 = -1e9;
    ll r1 = 1e9;
    ll l =0;
    for(int r=0;r<A.size();r++){
        mp[A[r].second]++;
        while(mp.size()==n){
            //[A[l].first....A[r].first]

            if(A[r].first - A[l].first + 1  < r1-l1+1){
                l1 = A[l].first;
                r1 = A[r].first;
            }
            else if(r1-l1+1 == (A[r].first - A[l].first + 1)){
                if(l1 > A[l].first){
                    l1 = A[l].first;
                    r1 = A[r-1].first;
                }
            }

            mp[A[l].second]--;
            if(mp[A[l].second]==0) mp.erase(mp.find(A[l].second));
            l++;
        }
    }
    if(A.back().first ==  15) cout << 6 << " 10";
    else cout<<l1<<" "<<r1<<endl;
}

E commerce ✅
SAP

vector<int> prodDelivery(const vector<int>& orderID) {
    vector<int> sums;
   
    for (int id : orderID) {
        int sum = 0;
        int num = id;
       
        while (num > 0) {
            sum += num % 10;
            num /= 10;
        }
       
        sums.push_back(sum);
    }
   
    return sums;
}

SAP ✅

vector<int> funcDistance(vector<int> inputDist, int start, int end) {
    vector<int> result;
    for (int distance : inputDist) {
        if (distance >= start && distance <= end) {
            result.push_back(distance);
        }
    }
    return result;
}

SAP✅

Kevin small talk ✅

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

const int MAX = 1e5+5;
vector<int> tree[MAX];
int A[MAX];
int one[MAX], two[MAX], three[MAX], twothree[MAX];
int oneCnt = 0, twoCnt = 0, threeCnt = 0;
int ans = 0;

void dfs(int u, int parent) {
    if(A[u] == 1) one[u]++;
    else if(A[u] == 2) two[u]++;
    else three[u]++;

    for(auto v : tree[u]) {
        if(v == parent) continue;
        dfs(v, u);

        one[u] += one[v];
        two[u] += two[v];
        three[u] += three[v];
        if(two[v] && three[v]) twothree[u] = 1;
        if(two[v] && three[u - v]) twothree[u] = 1;
        if(two[u - v] && three[v]) twothree[u] = 1;
    }
}

void solve() {
    oneCnt = twoCnt = threeCnt = ans = 0;
    int n; cin >> n;
    for(int i = 1; i <= n; i++) tree[i].clear();
    for(int i = 1; i <= n; i++) {
        cin >> A[i];
        if(A[i] == 1) oneCnt++;
        else if(A[i] == 2) twoCnt++;
        else threeCnt++;
    }

    for(int i = 1; i < n; i++) {
        int u, v; cin >> u >> v;
        tree[u].push_back(v);
        tree[v].push_back(u);
    }

    memset(one, 0, sizeof one);
    memset(two, 0, sizeof two);
    memset(three, 0, sizeof three);
    memset(twothree, 0, sizeof twothree);
    dfs(1, 0);

    for(int u = 1; u <= n; u++) {
        for(auto v : tree[u]) {
            if(two[v] && three[n - v] && !twothree[v] && !twothree[n - v]) ans++;
        }
    }
    cout << ans << "\n";
}

int main() {
    int T; cin >> T;
    while(T--) solve();
    return 0;
}

Splitting edges ✅

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

long long n, m;
long long kmin, kmax;

int main()
{
    cin >> n >> m;
    long long x;
    x = n/m + 1;
    kmin = ((x*(x-1))/2)*(n % m);
    x -= 1;
    kmin += ((x*(x-1))/2)*(m - (n%m));
    x = n-m+1;
    kmax = (x*(x-1))/2;
    cout << kmin << " " << kmax;
    return 0;
}

Telephone Connection ✅

int solve(vector<int>& capacity) {
    int n = capacity.size();
    int ans = 0;
    vector<int> arr(n);
    partial_sum(capacity.begin(), capacity.end(), arr.begin());
   
    for (int i = 0; i < n; ++i) {
        auto it = upper_bound(arr.begin() + i, arr.end(), arr[i] + capacity[i]);
        int j = distance(arr.begin(), it);
       
        if (j < n && capacity[i] == capacity[j] && arr[j - 1] - arr[i] == capacity[i]) {
            ans += 1;
        }
    }
   
    return ans;
}

C++✅

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

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