Question

Amazon | OA | SDE1 | Coding Questions and Solutions | 2022 | Set-76

Answer 1

CODE:

typedef long long int ll ;

long gg(vector <int> parcels, int k) {
    
    unordered_map <ll,ll> gg ;
    int i = 0 ;
    while(i<parcels.size()) {
        gg[parcels[i]]++;
        i++;
    }
    
    int n = parcels.size();
    int ii = n ;
    //cout<<ii<<"\n";
    i = 1 ; ll rm = 0 ;
    while(i<=2000000+55){
        if(gg[i]==0 && ii<k) {
            //cout<<i<<"\n";
            rm = rm + i ;
            ii++;
        }
        
        i++;
    }
    
    return rm ;
    
    
}

Answer 2

Images of ques

 

Comments

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

int main()
{
    vector<int>arr{2,3,6,10,11};
    int n=arr.size();
    int k=9;
unordered_map<int,int>mapping;
for(auto i:arr)
{
mapping[i]++;
}
    long long int  cost=0;
    
    long long int i=1;
    while(i<INT_MAX and n<k)
    {
   if(mapping[i]==0)
{
cost+=i;
n++;
}

     i++;
    }

    cout<<cost;
}