I interviewed at Google, here are the GOOGLE INTERVIEW QUESTIONS!

[KingofCamelot]

Tough questions.

Guess I won't be interviewing for Google anytime soon.

 

[ultimatebob]

Man, I hope that they give their IT guys a different set of interview questions. I can't answer any of those questions because I do not come from a Math or CS background, but frankly I wouldn't NEED to be able to answer any of those questions to do my job.

 

[cressida]

Google hires from all over but you pretty much gotta be a guru programmer.

 

[hypn0tik]

Yeah, I worked out #6 and it turns out to be a flower type region. PM me for details of solution if you'd like. My initial guess was incorrect.

 

[Aharami]

i think i just crapped my pants trying to solve those problems

 

[ones3k]

Lol hypn0tik, good work. To work at google, you would of had to solve that in 15minutes.

 

[stateofbeasley]

I guess I have no chance at Google then

<-- Can't even spot the issues in those questions.

Originally posted by: ones3k
Lol hypn0tik, good work. To work at google, you would of had to solve that in 15minutes.

 

[ones3k]

Even if you were the second coming of Einstein, you'd have no chance unless you had a degree from either MIT or CMU.

 

[ones3k]

bump

 

[Hacp]

Originally posted by: ones3k
Even if you were the second coming of Einstein, you'd have no chance unless you had a degree from either MIT or CMU.

CMU? They have a famous comp sci program???

 

[mugs]

Originally posted by: Hacp

Originally posted by: ones3k
Even if you were the second coming of Einstein, you'd have no chance unless you had a degree from either MIT or CMU.

CMU? They have a famous comp sci program???

Carnegie Mellon? Yeah... Ever heard of the Software Engineering Institute?

 

[Anubis]

yea you coudl give me a year to solve some of those and i still wouldent be able to

 

[stateofbeasley]

Are you kidding me??? Carnegie Mellon has one of the top CS programs in the country.

I'm just a humble law student at Temple University. I wouldn't know the first thing about this stuff anyways.

Originally posted by: Hacp

Originally posted by: ones3k
Even if you were the second coming of Einstein, you'd have no chance unless you had a degree from either MIT or CMU.

CMU? They have a famous comp sci program???

 

[jaybert]

Originally posted by: Hacp

Originally posted by: ones3k
Even if you were the second coming of Einstein, you'd have no chance unless you had a degree from either MIT or CMU.

CMU? They have a famous comp sci program???

seriously?? #1 CS program...i consider it more prestigious than MIT personally

 

[Evadman]

Ok, I can answer exactly one of those. Geez, I have no chance.

 

[FreshPrince]

Originally posted by: DAGTA

Originally posted by: EKKC
i doubt people in google knows how to answer this.

which makes me mad why they test you in a job interview, that's just plain stupid.
good thing before i landed my current job last august, i been to 3 interviews and none of them tested me (they all gave me offers too, batting 1.000 ) I also accepted them all. lol

I don't. Google has and continues to make a point of hiring the best people that can find. That is how they are able to make such amazing software. The technology behind their massive server farms is incredible.

do you have a link of how the technology behind their server farms look like? or how it's all connected?

 

[ones3k]

n! has floor (n / 5) zeros. bump

 

[stateofbeasley]

Well, I don't know about #1, but certainly on par with MIT, Stanford, etc.

Originally posted by: jaybert
seriously?? #1 CS program...i consider it more prestigious than MIT personally

 

[BigJ]

4 and 5 are answerable after taking OOP I and II, which is first year stuff.

 

[ones3k]

post solutions for everyone to see

 

[mugs]

Originally posted by: ones3k
=========================================================
Question #1) Given k sorted streams where each stream could possibly be infinite in length, describe an efficient algorithm to merge the k streams into a new stream (also in sorted order).

This is a basic algorithm I came up with, in English.

Start by ordering the k streams by the value of their first item. Pick the first item off the first stream (because you know it's the smallest). Compare the new first item in the first stream to the second. If the item in the first stream is bigger than the item in the second stream, iterate through the streams until you find the first stream's new correct spot, and move it there. Pick the first item off the new first stream. Repeat.

 

[TuxDave]

Originally posted by: mugs

Originally posted by: ones3k
=========================================================
Question #1) Given k sorted streams where each stream could possibly be infinite in length, describe an efficient algorithm to merge the k streams into a new stream (also in sorted order).

This is a basic algorithm I came up with, in English.

Start by ordering the k streams by the value of their first item. Pick the first item off the first stream (because you know it's the smallest). Compare the new first item in the first stream to the second. If the item in the first stream is bigger than the item in the second stream, iterate through the streams until you find the first stream's new correct spot, and move it there. Pick the first item off the new first stream. Repeat.

I kinda had the same idea. Sort the k streams by the first element. Take one off the top stream and look at the next element. I know that when you move this stream down to the correct sorted location every first element of the stream it passes goes directly into the final stream without needing to look at it. I just can't figure out the last optimization.

 

[TallBill]

55 hours a week is a lot? hahahahah, ok

I work slightly more then that at 1/4th the pay. And I actually have to go outside and stuff.

 

[statik213]

Question #6) Given a square with side length = 1, describe all points inside square that are closer to the center of the square than to the edge of the square.

Why is everyone overthinking this question?
Isn't it simply all the points within the square with side lenght 1/2 centered at the same point as the bigger square?

 

[ones3k]

TallBill, do you work at burger king? Google doesnt pay that well actually.