Slashdot Mirror


Want To Work At Google?

ramboando writes "In an article on the ZDNet site 'chief culture officer' and HR boss Stacy Savides Sullivan describes the kind of traits that she's looking for in potential Google employees. If you're thinking about applying, she also goes over what kind of questions one might be asked in an interview, Google's 'happiness survey' and the best perks that makes employees tick and stay with the company (Google ski-trips or paid paternity leave, anyone?). 'I think one of the hardest things to do is ensure that we are hiring people who possess the kind of traits that we're looking for in a Google-y employee. Google-y is defined as somebody who is fairly flexible, adaptable and not focusing on titles and hierarchy, and just gets stuff done. So, we put a lot of focus in our hiring processes when we are interviewing to try to determine first and foremost does the person have the skill set and experience potential to do the job from a background standpoint in addition to academics and credentials.'"

4 of 458 comments (clear)

  1. Is this a job ad? by Timesprout · · Score: 4, Informative

    Seems like quite a few people have been leaving Google lately

    --
    Do not try to read the dupe, thats impossible. Instead, only try to realize the truth
    What truth?
    There is no dupe
  2. I had an interview with Google a few weeks ago by skurk · · Score: 5, Informative

    A bit OT, but could be helpful to others applying for a job at Google:

    I had an interview with Google a few weeks ago. I didn't really know what I was getting into, as I applied just for fun.

    After the initial emails and phone calls, I was contacted by a local Google employee (developer) for a detailed phone interview. He wanted to ask me "some technical questions" I was told.

    Great, shouldn't be a problem? I got ready for C/C++/UNIX specific questions.

    He called and we did some minor chit-chat before beginning the interview. But, to my surprise, here's what he asked:

    The first question:
    "Imagine you have two marbles and a 100-story building. You are told that the marbles will break if they are dropped from a certain floor. Figure out a way, as effectivly as possible, how high you can drop the marbles before they break. Remember, it could be the 1st floor, it could be the 99th."

    Second question:
    "Let's say you have a computer with 2M RAM. This computer has a hard drive (with lots of free space) and a 100M file which you should sort. Let me know how you, as effectivly as possible, sort the file."

    Third question:
    "We take the computer from the previous question and replace the hard drive with a network adapter. You have no local storage but the RAM. You will receive one million eight-digit phone numbers through a TCP stream which you shall sort in RAM. You are now allowed to send any data before all the numbers have been sorted. How would you solve this?"

    Needless to say, the interview didn't go very well and ended with him saying "Well.. I've heard enough. Buh-bye."

    --
    www.6502asm.com - Code 6502 assembly or.. DIE!!
    1. Re:I had an interview with Google a few weeks ago by skurk · · Score: 4, Informative

      Woah! You had to answer those questions on the phone whilst he was talking to you?

      Yup, on the phone. I have 22+ years of programming on my back, and I applied for a position named "system developer". If I knew they were looking for some search engine optimizing guru, I wouldn't even bother contacting them in the first place.

      BTW - the second question there was a bit meaningless - how can you 'sort a 100MB file'? Do they want the file in byte order (..)

      Ah, yes. Sorry, I thought that was obvious.

      IIRC, the correct answers (according to Google) were:

      1st question: Start on the 14th floor. If it breaks, start with the second marble on the 1st floor and increase until it breaks. If it doesn't, go to the 14+13th floor, then 14+13+12th, etc. That gives you a maximum of 14 attempts.

      2nd question: Split the file into 2M segments on disk, sort them (for example with quicksort) then use mergesort to get everything back together.

      3rd question: Sort everything in RAM using bit vectors.

      If you disagree with the answers, contact Google. :-)

      --
      www.6502asm.com - Code 6502 assembly or.. DIE!!
  3. Here's my inside scoop at a google interview by dummkopf · · Score: 4, Informative

    Passed the first stage with HR, then had the interview with one of the engineers. The guy asked the mandatory question "tell me what you do" but after two minutes cut me off as it was clear he was not interested in optimization problems in physics. It was clear from the start that we spoke "different languages" and that lunchtime was looming in Mountain View, i.e., he was in a rush. Then he asked me some test questions. For example: "Suppose I give you a phonebook and ask you for a name, how long would that take?" As you can see, the question and answer are wide open. I told him that if the book had N pages, it would take me worst case N lookups. He was not pleased and asked for a faster solution. Hence I said, OK, I throw it into a hash and then the lookup is O(1). Then he complained that there would be too much preprocessing (although I would expect google to hash things...). He wanted "something in between". Hence I said, OK, let's sort the book and then partition to the name wanted, i.e., O(log(N)). Then the guy asked what log that was. I said that it does NOT matter since, in the O-notation prefactors are irrelevant and as you might know, you can always transform a log from one base to another by just a multiplicative factor. That was not a pleasing answer and he kept asking me to what base. Eventually I told him base 2, if he really had to know, but it did not matter. I admit I did not well in the interview, but the guy at the other end did NO effort in leading a good interview. The next question was (since I do some distributed computing) if I have many clients and they want to upload data to a server, what is the best way to do that. Again waaaaay open. I said, well, the client sends a request and when the server is free it answers and gets the data. Not good. Might overwhelm the server. Of course he would not tell me what he wanted to hear so I poked around a bit to realize that he wanted that the server floods the network with a "I am free signal" and then clients can upload the data. So what about reaching the limit of the network? "Well, that is not an issue here". Aha, I thought, I see, an issue is only what the guy deems to be an issue. At that point it was noon in Mountain View and he suddenly wanted to hang up. No "do you have any other questions?" or anything that shows good manners from an interviewer. Hence I decided to stop him cold and said "I have some questions for you". You could feel how pissed he was about this -- after all lunch is looming around the corner -- and he gave me the probably shortest answers you could think. For questions which I had gathered from whitepapers published by google (and there are only FEW out there) he would always say "I cannot talk about that".

    So... You really want to work there? Yes, you get lots of money, yes you get brainwashed it seems and rather arrogant after a while. Granted, this was one guy only, but letting him onto candidates which are not necessarily computer scientists. Hm... Needless to mention, Ihad a negative email the net day. Note that I did NOT apply for a job at google. One day I had an email from a HR person in mymailbox with the Subject "Hello from Google",and that's when this story started...