Impressed with L3 Google Interview

Apple mintdragon
Nov 17, 2018 61 Comments

Interviewed with Google today. I was very impressed with the questions. I've never seen any of those before, on leetcode, hackerrank. 4 interviews went pretty well. I screwed up 1 royally. Topics covered were trees, lists, stacks/queues, math, graphs.

Recruiter told me if there's a positive feedback in a week, application will go to HC then team search.

1. Does the lunch interview count? What is its aim?
2. Does one no-hire mean a total no-hire?
3. I told the recruiter that I'm interviewing with Amazon and Facebook. He didn't seem to give a duck. Why?

TC 200K

comments

Want to comment? LOG IN or SIGN UP
TOP 61 Comments
  • Booking.com / Eng a bug
    Why don't you go and upload those questions on Leetcode to help us all? ๐Ÿ˜‹
    Nov 17, 2018 3
    • Apple mintdragon
      OP
      NDA?
      Nov 17, 2018
    • Booking.com / Eng a bug
      Send me questions in DM and I'll upload. ๐Ÿ˜‚
      You can't be the only one to have these questions asked.
      Nov 17, 2018
    • Apple mintdragon
      OP
      I've updated the post with questions.
      Nov 17, 2018
  • Nvidia Artart
    I did terrible on one interview, ok on another one, I found a O(1) solution for the third problem and I totally killed the last one. My interviewer was so excited about my solution and I didn't even have time to ask him questions about his job because we were too busy talking about my approach.

    I think I got a no hire from at least one of them. I really doubt how I could get something else on that interview. But, eventually they still made an offer. So I would expect that the last interviewer really advocated.
    Nov 17, 2018 5
    • Amazon crypto*
      When you say you killed last one, do you mean you were able to provide the optimal solution very fast + solve the follow up question as well ?
      Nov 17, 2018
    • Apple mintdragon
      OP
      I couldn't do anything with it.
      Nov 17, 2018
    • Amazon crypto*
      Sorry this question was for @Artart Nvidia on his post
      Nov 17, 2018
    • Nvidia Artart
      Yes. It was a graph problem: a few traversal to do. Then the interviewer said we now construct the graph by adding a new node every time can you find a better way than just calling your algorithm N times on each version of the graph.

      I came up with an incremental solution by checking only neighbors of the new nodes and also considering nodes as union-find elements
      Nov 20, 2018
    • Leetcode - Number of islands 2 :P
      Thatโ€™s the question Artart from Nvidia was asked :P
      Jan 23
  • Goldman Sachs pakalu
    What was the difficulty level of questions?also no questions on dynamic programming?
    Nov 17, 2018 5
    • Apple mintdragon
      OP
      LC hard all. 4 DP questions.
      Nov 17, 2018
    • Booking.com / Eng a bug
      Wow! They expect you to solve 4 LC hard problems in a row?
      Nov 17, 2018
    • Apple mintdragon
      OP
      I've updated the post with questions.
      Nov 17, 2018
    • These arenโ€™t all lc hard right? Neither are these all dp.

      What was the location?
      Nov 17, 2018
    • Apple mintdragon
      OP
      I update the question 1. Missed some detail. I found them hard considering time into account. MTV
      Nov 17, 2018
  • Dell / Data Sabuu
    Can you post coding questions here?
    Nov 17, 2018 3
    • Apple mintdragon
      OP
      NDA?
      Nov 17, 2018
    • Dell / Data Sabuu
      This is anonymous forum. Do a favor in return
      Nov 17, 2018
    • Apple mintdragon
      OP
      Posted the questions.
      Nov 17, 2018
  • Google / Eng googler4
    ...and now I have to ban the interview questions. Thanks
    Nov 17, 2018 0
  • Booking.com / Eng a bug
    In 1, what's the caveat?
    You can build a Trie with all words in reverse and that solves the problem. Am I missing something?
    Nov 17, 2018 5
    • Akamai Technologies bellq
      Yea even I thought the same! Does it miss any edge cases?
      Nov 17, 2018
    • Apple mintdragon
      OP
      I missed a detail. Did exactly what you suggested. Then the interviewer followed up with the prefix part. Given a prefix how will you search for all words that start with that prefix.

      I figured that he wanted me to build a doubly linked trie.
      Nov 17, 2018
    • Xperi Meowmeowi
      You could branch out from each trie node by pairs of characters (p_c, s_c) instead of a single character. And when you add a string, you take pairs of characters from the given string and the reversed string.
      Nov 17, 2018
    • Apple mintdragon
      OP
      That's smart. But when you go back to search, wont that take an extra O(n) loop?
      Nov 17, 2018
    • Xperi Meowmeowi
      It shouldn't. Each trie traversal is performed by character pairs (pc, sc) at each step taken from the given (prefix, suffix). You ll just need extra memory in each node.
      Nov 17, 2018
  • Booking.com / Eng a bug
    Problem #4 is there on leetcode.
    Search for "Candy".
    Nov 17, 2018 3
    • Apple mintdragon
      OP
      Thank you. I came up with O(2n). There's an O(n) approach that's really cool
      Nov 17, 2018
    • Booking.com / Eng a bug
      Was the interviewer expecting you to do in single pass? That would be too much to expect in an interview.
      Nov 17, 2018
    • Apple mintdragon
      OP
      No. I think he was ok with 2n solution.
      Nov 17, 2018
  • Deutsche Bank / Eng Doooo
    It's absolutely dumb to post questions specially when you signed the NDA and your interview was in last couple of days !
    Nov 17, 2018 1
    • Akamai Technologies bellq
      Questions are already floating around in chinese social platforms..why should only chinese have all the fun!
      Nov 17, 2018
  • LinkedIn pantyfans
    Unless mintdragon is your legal name, posting questions on this anonymous forum will be fine. Giving back.

    I heard that goog recently revamped their question bank so what you experienced isn't surprising.
    Nov 17, 2018 1
    • Apple mintdragon
      OP
      I've updated the post with questions.
      Nov 17, 2018
  • Microsoft yswhbhs
    For#3, is there a limit on the value of a an b?
    Nov 17, 2018 0
  • Yahoo ExFat64
    1) no, unless u showing sign of racism or verbally harassment
    2) yes, unless u have at least one interviewer advocating (heard, need confirm)
    3) u can start talking only after the result is revealed (fairly quick) and that they decide to move on
    Nov 17, 2018 3
    • Google Yoshka
      2 is not true. Can usually still be hired with one no hire as long as it's not a "strong" no hire and the other interview feedback balances it out.
      Nov 17, 2018
    • Google Auxu40
      1 No Hire is a no hire.
      Nov 17, 2018
    • Yahoo ExFat64
      How many diff rating of no hire are there? No hire means no hire! Or did u mean hire but can be convinced not to? Thatโ€™s different. FB immediately reject when there is at least one no hire.
      Nov 17, 2018
  • VMware / Eng vm12
    not a good idea to post questions.
    Nov 17, 2018 2
    • Apple mintdragon
      OP
      Thanks
      Nov 17, 2018
    • Square / Eng nnnggg
      Yeah. Posting one may be fine since they should have all been asked many times. However a combination of them...
      Nov 17, 2018
  • New nCwd48
    Could you please share the Qs?
    Jan 15 0
  • Google manraptor
    1) lunch interview doesn't count unless you did something overtly stupid, like spout your racist view points or come across as a huge jerk. It's mostly for you to get a vibe of the office and more laid back candid feedback from someone who's not grilling you.
    2. I don't think so, but not sure. obviously would be better if you had 100% buy in from everyone.
    3. No clue.
    Nov 17, 2018 0
  • Akamai Technologies bellq
    Op..Which one is the graph problem. I dont think the 4 ques you hav put needs graph..
    Nov 17, 2018 3
    • Apple mintdragon
      OP
      There was a 5th question. I don't know how to write it down honestly. Basically given two graphs connected by two "highways" and a time series database (contains traffic details at every hour), we have to predict optimum routes at every hour.
      Nov 17, 2018
    • Akamai Technologies bellq
      Oops did you solve this one?
      Nov 17, 2018
    • Apple mintdragon
      OP
      This is the one I screwed. Didn't know where to start. Interviewer gave some hints and I wrote some modules. But didn't go far. I chose adjacency matrix to start and it seemed like a bad choice later.
      Nov 17, 2018
  • Amazon / Eng HelloGuys
    Where are the questions?
    Nov 17, 2018 2
    • Indeed tookerjerb
      Youโ€™re too late to the party
      Nov 17, 2018
    • Amazon / Eng HelloGuys
      Anyone can DM me those questions? Thanks.
      Nov 17, 2018
  • Intel !!!???
    What level is this for? Did you have a system design interview as well?
    Nov 17, 2018 2
    • Apple mintdragon
      OP
      Read the post title again?
      Nov 17, 2018
    • Intel !!!???
      Yeah just realized. Whoops
      Nov 17, 2018
  • IBM thic
    How did you solve #3 in linear time? Is there some missing info?
    Nov 17, 2018 1
    • Dell / Data Sabuu
      I am thinking about it and still have no clue! Any idea?
      Nov 17, 2018
  • Trulioo JHOY58
    Could I get a DM for the questions as well? Thanks!
    Feb 13 0
  • Goldman Sachs pakalu
    How did you solve third problem? Merge sort /BST?
    Nov 17, 2018 0