Seats

 https://www.interviewbit.com/old/problems/seats/


int Solution::seats(string A) {
for(int i=0;i<A.size();i++){
if(A[i]=='x')
pos.push_back(i);
}
int n=pos.size();
long long int ans=0;
int mid=n/2;int k=1;
for(int i=mid-1;i>=0;i--){
ans=(ans+pos[mid]-k-pos[i])%10000003;
k++;
}
k=1;
for(int i=mid+1;i<n;i++){
ans=(ans+pos[i]-(pos[mid]+k))%10000003;
k++;
}
return ans%10000003;
}

















Comments

Post a Comment

Popular posts from this blog

Is Rectangle?

 https://www.interviewbit.com/old/problems/is-rectangle/ int Solution::solve(int A, int B, int C, int D) {      if (((A==B)&&(C==D))||((A==C)&&(B==D))||((A==D)&&(B==C))){         return 1;     }else{         return 0;     } }  
Read more

Smaller or equal elements

Given an sorted array A of size N . Find number of elements which are less than or equal to B .   int Solution::solve(vector<int> &A, int B) {     int start=0;     int ans=0;     int end=A.size()-1;          while(start<=end)     {         int mid=(end+start)/2;                 if(A[mid]<=B)        {            ans=mid+1;            start=mid+1;        }        else{            end=mid-1;        }     }     return ans; }
Read more

Game of Stones

 https://www.hackerrank.com/challenges/game-of-stones-1/problem?h_r=internal-search string   gameOfStones ( int   n )   {      string   ans = "" ;      if ( n % 7 == 0   ||   n % 7 == 1 )   ans += "Second" ;      else   ans += "First" ; return   ans ; }
Read more