## jaryya@hawk.iit.edu

BAN USER- 0of 0 votes

AnswersA new senior trader has been invited to a gathering of traders from all around London. She goes there and tries to meet as many traders as she can. When she meets someone she generally remembers them by the market sector they deal in.

- jaryya@hawk.iit.edu in India

36 traders deal in the fx market.

32 traders deal in the derivative market.

39 traders deal in the crude oil market.

37 traders deal in only one market.

8 traders deal in all the three markets.

All traders deal in atleast one of the three markets.

Number of traders who deal in both derivative and crude oil but not fx was one less than the number of traders who deal in both fx and derivative but not crude oil.

The sum of the number of traders who deal in both fx and crude oil but not in derivative and in both crude oil and derivative but not fx was two greater than twice the number of traders who deal in both fx and derivative but not crude oil.

How many traders deal in both fx and crude oil but not derivative?

Find someone who has solved the first half of their collaboration question and ask them for the solution they got. You both have to solve the below question together and then come to us with your solution.

Let x be your result and y be the result for your partner

Then, P = (10* x/2)+ floor(y/4). Use p as an input to the next question.

According to the recent report published by the Human Resource team at a FinTech startup, the number of employees is 500 at present. They have been divided into four teams, named Technology, Operations, Management and Legal.

The report also tells that out of these employees, P% are campus recruits while the remaining have prior work experience. The number of employees in each team can be no less than 50 and no more than 175.

The following partially filled table shows the information about the break-up of the employees in terms of campus recruits or with work experience in the four teams.

Team Campus Recruit Work Experience

Technology 55% -

Operations - 45%

Management 55% -

Legal m% n%

What can be said about the relative values of â€˜mâ€™ and â€˜nâ€™?

a. m>n b. m<n c. m>=n d. m<=n| Report Duplicate | Flag | PURGE

Goldman Sachs Analyst - 0of 0 votes

AnswersWas asked at the Grace Hopper Celebration India (Bangalore) career fair at the GS booth.

- jaryya@hawk.iit.edu in India

How many golf balls are going to fit in the Boeing manufacturing warehouse?

My response:

Estimation problem, volume of the warehouse is approx 13.5*10^5 m^3 and vol. of each golf ball is 4/3*3.14*0.002^3 The space between every 8 golf balls is ~ equal to 1 golf ball...| Report Duplicate | Flag | PURGE

Goldman Sachs Analyst - 0of 0 votes

AnswersWas asked at GHCI Bangalore at their booth for a prize and perhaps hiring interns or experienced software developers.

- jaryya@hawk.iit.edu in India

Find the return value for N=100

int returnAns(int N){

int ans=0;

for(int i=0; i<N; i++){

for(int j=i+1; j<N; j++){

ans +=((i & -i) == (j & -j)?1:0); //the question missed the condition and was returning a boolean, so I added it myself

}

}

return ans;

}

My answer: 0 ; their answer: 1610, hence got it wrong.

My explanation: I assumed negative of i in binary to be

simply represented by setting the MSB to 1 e.g. for 8 bit representation of 3: +3 is 0000 0011 and -3 is 1000 0011. In the inner loop the value of ans will always evaluate to 0 since Bitwise & of these i and -i or j and -j will always result into i and j respectively. (undergrad computer organization concept.)

Negative numbers can also be represented as 1s and 2's complement and in all modern machines by architecture its 2s complement.

Now if we assume 1's complement, +3: 0000 0011 and -3: 1111 1100. so bitwise & of these two is 0 and so the value of ans will always be incremented by 1. By two loops 100+99+98+97+...+1 = 100*101/2 (i.e. n*(n+1)/2)

Then 2's complement, which is the most relevant representation of signed binary numbers.

Odd numbers:

+3: 0000 0011 -3: 1111 1101 Binary & is 0000 0001.

For all even numbers:

+4: 0000 0100 and -4: 1111 1011+0000 0001 = 1111 1100 and Bitwise & of 4 and -4 is 0000 0100 which is 4.

So, in the innermost loop ans is incremented by 1 when i is odd and j is also odd. ie. when i is 1, 3, 5, 7... 97 and j is 3, 5, 7, 9,...,99 ans is added 1(return value of true ==) when calculated it comes to 1610.| Report Duplicate | Flag | PURGE

Google Software Developer Algorithm

**CareerCup**is the world's biggest and best source for software engineering interview preparation. See all our resources.

Open Chat in New Window