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

const int MOD = 1e9 + 7;

long long solution(int n, vector<long long>& a, vector<long long>& b) {
    long long ans = 0;

    int minP = min_element(a.begin(), a.end()) - a.begin();
    int minQ = min_element(b.begin(), b.end()) - b.begin();

    for (int i = 0; i < n; i++) {
        if (i == minP || i == minQ)
            continue;

        ans += min(a[minP] * b[i], b[minQ] * a[i]);
        ans %= MOD;
    }

    if (minP != minQ) {
        ans += a[minP] * b[minQ];
        ans %= MOD;
    }

    return ans;
}.

professor code
Uber

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

int main() {
    int n,c,d ;
    cin>>n>>c>>d ;
    int b[n],p[n],t[n] ;
    for(int i=0;i<n;i++)
        cin>>b[i]>>p[i]>>t[i] ;
    vector<pair<int,int>>type_0,type_1 ;
    for(int i=0;i<n;i++)
    {
        if(t[i]==0)
        {
            type_0.push_back({p[i],b[i]}) ;
        }
        else
        {
            type_1.push_back({p[i],b[i]}) ;
        }
    }
    sort(type_0.begin(),type_0.end()) ;
    sort(type_1.begin(),type_1.end()) ;
    // One using coins and one using diamonds
    int max_0=0,max_1=0 ;
    int x=type_0.size() ;
    int y=type_1.size() ;
    for(int i=0;i<x;i++)
    {
        if(type_0[i].first<=c)
            max_0=max(max_0,type_0[i].second) ;
    }
    for(int i=0;i<y;i++)
    {
        if(type_1[i].first<=d)
            max_1=max(max_1,type_1[i].second) ;
    }
    int ans=0 ;
    if(max_0&&max_1)
        ans=max(ans,max_0+max_1) ;  
    // Both using coins
    multiset<int>m;                        
    for(int i=0;i<x;i++)
    {
       m.insert(type_0[i].second) ;
    }
    int j=type_0.size()-1 ;
    for(int i=0;i<x;i++)
    {
        if(j<=i)
            break ;
        auto it=m.find(type_0[i].second) ;
        m.erase(it) ;
        int flag=0 ;   
        while(j>i)
        {
            if(type_0[j].first+type_0[i].first<=c)
            {
                flag=1 ;
                break ;
            }
            auto it=m.find(type_0[j].second) ;
            m.erase(it) ;
            j-- ;
        }
        if(flag==0)
            break ;
        if(m.size())
        ans=max(ans,type_0[i].second+*m.rbegin()) ;  
    }
    // Both using diamonds
    m.clear() ;
    for(int i=0;i<y;i++)
    {
       m.insert(type_1[i].second) ;
    }
     j=type_1.size()-1 ;
    for(int i=0;i<y;i++)
    {
        if(j<=i)
            break ;
        auto it=m.find(type_1[i].second) ;
        m.erase(it) ;
        int flag=0 ;
        while(j>i)
        {
            if(type_1[j].first+type_1[i].first<=d)
            {
                flag=1 ;
                break ;
            }
            auto it=m.find(type_1[j].second) ;
            m.erase(it) ;
            j-- ;
        }
        if(flag==0)
            break ;
        if(m.size())
        ans=max(ans,type_1[i].second+*m.rbegin()) ;
    }
    cout<<ans<<"\n" ;
    return 0;
}

Uber

List<Character> duplicates = new ArrayList<>();
        for (int i = 0; i < inputchar.size(); i++) {
            for (int j = i + 1; j < inputchar.size(); j++) {
                if (inputchar.get(i).equals(inputchar.get(j)) && !duplicates.contains(inputchar.get(i))) {
                    duplicates.add(inputchar.get(i));
                    break;
                }
            }
        }
        return duplicates;
    }

Program to find duplicate in element Array
IBM

🎯PayPal is hiring

Role : Software Engineer
Batch : 2022, 2023 passouts

Apply Now:- https://paypal.eightfold.ai/careers/job?domain=paypal.com&pid=274899570229&query=R0111166&domain=paypal.com&sort_by=relevance&job_index=0

Telegram:- @allcoding1

🎯Microsoft is hiring SDE-1

For 2023, 2022, 2021 grads

Expected CTC - 40LPA

https://jobs.careers.microsoft.com/us/en/job/1694673/Software-Engineer

🎯Reliance-Jio Off Campus Drive 2024 Hiring As Data Scientist | INR 4-6 LPA

Job RoleData Scientist
QualificationB.E/B.Tech/B.Sc
ExperienceFreshers
Salary4-6 LPA

Apply Now:- https://www.allcoding1.com/2024/05/reliance-jio-off-campus-drive-2024.html

Telegram:- @allcoding1

🎯Druva Off Campus Drive 2024 Hiring For Software Engineer Role | INR 4 LPA

Job Role : Software Engineer
Qualification : B.E./B.Tech./M.E./M.Tech./MCA/M.Sc
Location : Pune
Package : 4 LPA

Apply Now:- https://www.allcoding1.com/2024/05/druva-off-campus-drive-2024-hiring-for.html

Telegram:- @allcoding1