TranceAddict Forums (www.tranceaddict.com/forums)
- Chill Out Room
-- Microsoft interview Question...
Pages (2): [1] 2 »

Microsoft interview Question...

U got 50 people in one room, they cant talk to eachother nor having body movement, 25 of them got red cap on , the other 25 got green cap..They all can see eachothers cap but not they own cap, how r they suppose to walk out of the room and split the 2 color equally? like red on one side and green on the other....

if u heard this dont say the answer , thanx^^ ill post answer shortly..

... by moving their legs... I suppose?

lets say u r one of them... how r u gonna split the 2 colors?

The answer is pretty straight forward. I've never heard of this problem before so am I allowed to say the answer?

sure

I don't get it... if it's known that there are 25 of each, they can just count the caps in advance... if they see 24 red ones then they're red, if they see 24 green ones then they're green.

Then 1 random person goes to one side and everybody else follows up based on their cap colour.

This seems like a trivial version of the "hats in a line" problem (which is fairly trivial in and of itself).

EDIT: ^^^^ Damn you DigiNut

I suppose you could walk around the room and count everyone according to their hats. You'll end up with 24 of one and 25 of the other and therefore you know what colour your own hat is. If everyone does this then problem solved.

lets say u wake up in a room with 49 other people and some r red some r green. and u cant c ur own cap...so u cant count in advance how u gonna split it up when u walk out dat door...?

lets say its a dark room where u cant see anything...but u know there r red N green caps..how u guys gonna walk out and split up

Well it's still fairly simple I guess... just form 4 groups. Let's assign group 1 to red and group 2 to green.

First person goes to group 3. Next person goes to group 3 if the last person was red, group 4 if the last person was green. Then the last person goes to group 1 if the person behind went to 3, or group 2 if he went to 4. Keep repeating this process until there is only 1 person left. Then the right colour group can just go to him, because they know what colour they are by looking at the other people in their group.

No communication involved, really. Not sure if this is "allowed" by the rules or not.

Edit: wtf, you keep changing it, you expressly stated it in the 1st post that "they can see each other's cap". You just trying to piss us off, or what? Anyway, you can still do what I said, just form the groups *outside* the dark room after walking out.

u go to the bog and take a look in the fuckin mirror - problem solved

quote:

Originally posted by UglyDave u go to the bog and take a look in the fuckin mirror - problem solved

haha

if u were the 3 person.. how would u know to go red or green?

quote:

Originally posted by DJ E-s*it if u were the 3 person.. how would u know to go red or green?

I think I explained that... you pick group 3 or 4 based on whatever the last person did. Then you wait there for the next person - if the next person goes to group 3, you were red, if they go to group 4, you were green.

If MTV did another special on clubbers, would you care?

I thought not....

I agree with DigiNut, he had it solved then you changed up some rules. wassup with that? Just start another problems for us/him to solve.

im sorry bout all the change ups.. didnt mean to , just because im a bad story/question teller.. anyways here is the answer...
first person walks out and stand there.. 2nd person stand next to him... when 3rd person goes out he stand in between the two of them... then whenever the next person walks out he 'll just look for the split of color and squeeze between them , at the end one sid ebe red other be green... sorry bout the bad question asking.. next question coming in 5 mins

3 friends went to a motel late at nite.. they wanna ck in and the clerk told them it cost $30 a nite per room. They were cheap so they decided to sty in one room.. everyone took out $10 for the rent and just when they bout to head to their room the clerk told them he is giving them a discount 5 dollar.. so everyone was happy.. each of them got $1 dollar back. and the $2 extra they gave the bag handler for tip.. this means each of them paid $9 dollar 9X3= 27 + the 2 dollar they gave for tip = $29 where is the $1?

quote:

Originally posted by DJ E-s*it 3 friends went to a motel late at nite.. they wanna ck in and the clerk told them it cost $30 a nite per room. They were cheap so they decided to sty in one room.. everyone took out $10 for the rent and just when they bout to head to their room the clerk told them he is giving them a discount 5 dollar.. so everyone was happy.. each of them got $1 dollar back. and the $2 extra they gave the bag handler for tip.. this means each of them paid $9 dollar 9X3= 27 + the 2 dollar they gave for tip = $29 where is the $1?

That's so old...

Instead of subtracting the tip to find out how much they paid for rooms (27 - 2 = 25) you add it to get the number 29 which is meaningless. It's simply a misleading question. No money disappeared, they paid $25 for the room and $2 for the tip, which is $27, $9 each. They did not pay $29, they paid $27. The numbers 29 and 30 are insignificant at the end of the question.

answered in 4 mins.. u could of let others think abit..hehe.. anyways.. next question in 5 mins...

ok here we go.....2 rooms, door closed, there r 3 switches outside of the room one for eachroom and last one is useless... everytime u wanna turn the switch ON the doors has to be shut closed. but when u switch them OFF then u can open the doors... how u gonna find out which switch is for which room? if u know this one too try not to answer so fast ^^

i have 11 fingers!

10, 9, 8,7,6 5,4,3,2,1

so .. 6+5 = omG im a freak

OK. Here is a cool question from Microsoft Interview.

There is a village.. People can see each other, but they cannot communicate and there are no mirrors in the village.

One night everybody has the same dream: At least one person in the village(could be anyone including you) got his hair painted green, and as soon as that person finds out that his hair is green he MUST leave the village.

1st morning: nothing happens.
2nd morning: nothing happens
3rd morning: everyone whos hair was painted leaves the village.


what happened ?



Here is one more:

You have two light bulbs and 100 storey building. You must determine the minimal floor such that if you drop the light bulb from that floor it breaks. Once you break a bulb, it can't be reused. Question: What's the smallest number of drops required in the WORST case to determine the minimal floor.

quote:

Originally posted by DJ E-s*it answered in 4 mins.. u could of let others think abit..hehe.. anyways.. next question in 5 mins...

That's because he's good like that!

quote:

Originally posted by Durafei OK. Here is a cool question from Microsoft Interview. There is a village.. People can see each other, but they cannot communicate and there are no mirrors in the village. One night everybody has the same dream: At least one person in the village(could be anyone including you) got his hair painted green, and as soon as that person finds out that his hair is green he MUST leave the village. 1st morning: nothing happens. 2nd morning: nothing happens 3rd morning: everyone whos hair was painted leaves the village. what happened ?

nothing?

I'll repost the question, make it more clear:

There is a village.. People can see each other, but they cannot communicate and there are no mirrors in the village.

One night everybody has the same dream: At least one person in the village(could be anyone including you) got his hair painted green, and as soon as that person finds out that his hair is green he MUST leave the village.

1st morning: Everyone gathers, looks at each other, and everyone goes home.

2nd morning: Everyone gathers, looks at each other, and everyone goes home.

3rd morning: Everyone gathers, looks at each other, and everyone who has hair painted leaves the village, others go home.


what happened ?

Powered by: vBulletin
Copyright © 2000-2021, Jelsoft Enterprises Ltd.