Google

Applied online. Received two phone interviews, each 45 minutes long. The first interview focused on my resume, and the coding question was about binary search. The second interview involved a permutation problem, and I was asked about its running t

The entire interview process consisted of a phone interview and a day of interviews at their Boston office. The phone interview went pretty well, with one main programming question. The interviewer asked me to explain how I would solve the problem a

I found it challenging. However, it is not a problem if you have brushed up on basic data structure problems and recursion. Exact syntax is not required; just a basic understanding of what each function will be doing is sufficient.