Question

RazorPay SDE1 Coding OA | March 2023

Answer 1

Pic of problem :- 

Comments

#include <bits/stdc++.h>
using namespace std;
#define int long long
int sumOfDigits(int x){
    int sum=0;
    while(x>0){
       sum+=x%10;
       x/=10;
    }
    return sum;
}
int32_t main() {
    int n;
    cin>>n;
    vector<int>arr(n);
    for(int i=0;i<n;i++)
    cin>>arr[i];
    int sum=0;
    for(int i=0;i<32;i++)
    {
       int k=0;int l=0;
       while(k<n)
       {
         int j=k;
         while(j<n && arr[j]&(1<<i))
         {
             l++;
             j++;
         }
         if(l==0)
         k++;
         else
         k=j;
         sum+=(1<<i)*(l)*(l+1)/2;
         l=0;
       }
       sum+=(1<<i)*(l)*(l+1)/2;
    }
    cout<<sum<<endl;
    return 0;
}

Answer 2

#include <bits/stdc++.h>
using namespace std;
#define int long long
int sumOfDigits(int x){
    int sum=0;
    while(x>0){
       sum+=x%10;
       x/=10;
    }
    return sum;
}
int32_t main() {
    int n;
    cin>>n;
    vector<int>arr(n);
    for(int i=0;i<n;i++)
    cin>>arr[i];
    int sum=0;
    for(int i=0;i<32;i++)
    {
       int k=0;int l=0;
       while(k<n)
       {
         int j=k;
         while(j<n && arr[j]&(1<<i))
         {
             l++;
             j++;
         }
         if(l==0)
         k++;
         else
         k=j;
         sum+=(1<<i)*(l)*(l+1)/2;
         l=0;
       }
       sum+=(1<<i)*(l)*(l+1)/2;
    }
    cout<<sum<<endl;
    return 0;
}