I applied online. The process took 3 weeks. I interviewed at Google in Nov 2016
Interview
The process was straightforward. They contact the interviewee and set up 1/2 phone interviews. The interviews are easy and pertain to your technical skills only. No behavioral/HR questions asked. No resume based questions. Cant disclose questions due to non disclosure agreement. prepare basic DS and algo questions and code from leetcode
I applied through a recruiter. The process took 4 weeks. I interviewed at Google (Mountain View, CA) in Dec 2016
Interview
The current engineering internship interview process consists of two parts, an online take home assessment (consists of two interview questions) and two technical phone interviews. Online assessment questions were average string and tree problems. Phone interviews were on the same level, but with an engineer. Overall the whole process was very standard. They personally phone call applicants that didn't make the cut, which is nice.
Interview questions [1]
Question 1
Given a list of words, develop two functions to serialize and deserialize into a single string.
Given a string in the format: 2(abc)4(df), write a function to decompress the string to the following format: abcabcdfdfdfdf
I applied online. The process took 1 day. I interviewed at Google (New York, NY) in Nov 2016
Interview
Two 45 minute phone interviews one after the other with two different interviewers. Neither felt particularly standardized, but one of them did seem to draw some of their questions from my resume. Biggest challenge that came up was understanding one of the interviewers, who had a fairly strong accent that came out badly through my phone speakers. Mostly resolved with lots of clarifying questions.
Interview questions [2]
Question 1
Can you implement a class that returns the "next" permutation (in no particular order) of representatives chosen from a list of lists. Also implement a method that determines whether there are any new permutations to return. I.e., when given [ [1 2] [b] [3 4] ] the permutations are: [1 b 3], [1 b 4], [2 b 3], [2 b 4].