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

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

long long m = 100000000000000000;

int minOperations(vector<int> &arr)
{
    int n=arr.size();
    if(n == 1) return 0;

    if(n == 2) return arr[0]+arr[1]<0;

    int cnt = 0;

    long long prev,curr,next;

    prev = m;
    curr = arr[0];
    next = arr[1];

    int ind = 1;

    while(ind<n)
    {   
        if(prev+curr+next<0 || curr+next<0)
        {
            prev = curr;
            curr = m;
            cnt++;
        }else{
            prev = curr;
            curr = next;
        }

        if(ind<n) next = arr[ind+1];
        ind++;
    }

    return cnt;
}

UKG ✅
Make the Array Positive

def find_consecutive_sets(n):
    result = []
    count = 0

    for i in range(1, n//2 + 2):
        sum_ = 0
        temp = []
        
        for j in range(i, n + 1):
            sum_ += j
            temp.append(j)
            
            if sum_ == n:
                result.append(temp[:]) 
                count += 1
                break
            elif sum_ > n:
                break

    result.reverse()

    for seq in result:
        print(" ".join(map(str, seq)))
    
    print(count)

n = int(input())
find_consecutive_sets(n)

Deloitte ✅