#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100005;
vector<int> tree[MAX_N]; 
vector<int> houses[MAX_N];
int A[MAX_N]; 
int parent[MAX_N];
void dfs(int node) {
    houses[node].push_back(A[node]);
    for (int child : tree[node]) {
        if (child == parent[node]) continue;
        parent[child] = node;
        dfs(child);
        houses[node].insert(houses[node].end(), houses[child].begin(), houses[child].end());
    }
    sort(houses[node].begin(), houses[node].end());
}

int getMaxD(int X, int K, vector<int>& housesInSubtree) {
    int low = 0, high = 1000000000, bestD = 0;
    while (low <= high) {
        int mid = (low + high) / 2;
        int count = 0;
        int left = X - mid, right = X + mid;
        auto lower = lower_bound(housesInSubtree.begin(), housesInSubtree.end(), left);
        auto upper = upper_bound(housesInSubtree.begin(), housesInSubtree.end(), right);
        count = upper - lower;
        
        if (count <= K) {
            bestD = mid; 
            low = mid + 1;
        } else {
            high = mid - 1; 
        }
    }
    
    return bestD;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N, Q;
    cin >> N >> Q;
    for (int i = 1; i <= N; ++i) {
        cin >> A[i];
    }
    for (int i = 1; i < N; ++i) {
        int u, v;
        cin >> u >> v;
        tree[u].push_back(v);
        tree[v].push_back(u);
    }
    parent[1] = -1;
    dfs(1);

    int result = 0;
    while (Q--) {
        int U, X, K;
        cin >> U >> X >> K;
        int d = getMaxD(X, K, houses[U]);
        result ^= d;
    }
    cout << result << endl;

    return 0;
}

Bad Guy ✅

Equifax is hiring Java Developer

For 2023, 2024 grads
Location: Pune / Trivandrum

https://careers.equifax.com/en/jobs/j00162626/java-developer-entry/

Orange Health is hiring Software Engineer

For 2021, 2022, 2023 grads
Location: Bangalore

https://app.pyjamahr.com/careers?company=Orange%20Health&job_id=159193&company_uuid=8A364EBF43&source=LINKEDIN&apply_now=true

int findmaximumPackages(vector<int>&arr)
{
    int n = arr.size();
    int mx = *max_element(arr.begin(), arr.end());
    mx = mx * 2;
    int res = 0;
    map<int, int>mp;
    for (auto it : arr) {
        mp[it]++;
    }
    for (int i = 1; i <= mx; i++) {
        int sm = 0;
        for (int j = 1; j <= (i - 1) / 2; j++) {
            sm += min(mp[j], mp[i - j]);
        }
        if (i % 2 == 0) {
            sm += (mp[i / 2] / 2);
        }
        res = max(res, mp[i] + sm);
    }
    return res;
}

Amazon ✅

public static long getMaxXor(long n) {
    if (n == 0) {
        return 0;
    }
    int x = 0;
    while (n >> x > 0) {
        x++;
    }
    return (1L << x) - 2;
    
   }

IBM✅

DELLOITE BIGGEST OFF CAMPUS HIRING FOR 2025 BATCH

Eligibility
2025 graduates of B.E./B.Tech /M.E./M.Tech / MCA - Cyber Security, Information Technology, Computer Science and/or other ancillary Circuital Branches

Apply link : https://usrecruiting.deloitte.com/national-level-assessment-deloitte-us-india-offices?#subpage/engineeringcyber/content/211390088

Company Name: DoSelect (Infoedge)

Different intern roles are there (6 months)

Apply: https://docs.google.com/forms/d/e/1FAIpQLSeyzdHcvzDKtq510sRy6usSsDut4ZLIeQKWeKK88S7Gh8Vusw/viewform

21 days coding challenge, participate and win prizes.

Link to register: https://tinyurl.com/5n7j78nh

Company Name : CoinDCX
Challenge Name : Unfold Hackathon 2024
Eligibility : All College Students + Working Professionals
Prizes : Bounties worth $100K + opportunities at CoinDCX and various companies

Link : https://bit.ly/coindcxunfold

Google Step Intern

https://www.google.com/about/careers/applications/jobs/results/121209170417328838-software-student-training-in-engineering-program-step-intern-2025-english