Question

Please put the full working code of this Amazon OA Problem | Urgent | 2022

Answer 1

C++ Working Code : 

#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
int main() {
    ll n;
    cin>>n;
    ll i = 0 ; 
    ll s = 0 ; vector <ll> b(n+5,0);
    while(i<=n-1){
        cin>>b[i];
        s+=(b[i]);
        i++;
    }
    
    ll mx = 1e18 ; 
    i = 0 ;ll rr = 0 ; 
    long double v = 0 ; 
    while(i<=n-2){
        v = v + b[i];
        long double v55 = abs(s-v);
        
        long double t = i + 1 ; 
        long double t55 = n - i ; 
        
        ll g = floor(v/t);
        ll g55 = floor(v55/t55);
        
        ll d = abs(g55-g);
        if(d<mx){
            mx = d ; 
            rr = i + 1 ; 
        }
        
        i++;
    }
    cout<<rr;
    
    
    
    return 0;
}