KingofCamelot
Golden Member
- Aug 20, 2004
- 1,074
- 0
- 0
Originally posted by: ones3k
Lol hypn0tik, good work. To work at google, you would of had to solve that in 15minutes.
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.
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???
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???
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???
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.
Originally posted by: jaybert
seriously?? #1 CS program...i consider it more prestigious than MIT personally
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).
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.
Why is everyone overthinking this question?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.