Ho presentato la mia candidatura online. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Google (Irvine, CA) nel mese di set 2012
Colloquio
I applied for google's new grad position that is available on Sep 1. They contacted me a few weeks later to set up a phone interview.
They gave me a list of categories to choose from (that I specialize in). Here were the choices: (choose 3)
* Advanced Algorithms
* Audio/video
* Billing/payment testing
* Compilers and software tools (linkers, debuggers, IDEs, etc.)
* Computer vision
* Concurrency, multi-threading, synchronization
* Database internals
* Distributed systems
* Embedded software and real-time systems
* Front end
* Graphics and imaging
* Information retrieval and data mining
* Internationalization
* Load and performance testing
* Mac and iPhone development
* Machine learning and AI
* Natural language processing
* Networking (TCP/IP and OSI stack)
* Object-oriented analysis and design
* Operating systems
* Production Systems
* Project Management
* QA
* Security and cryptography
* System administration
* Test automation
* UI design and implementation
* Web applications and multi-tiered systems
* Windows development
* Wireless applications
They also wanted you to choose your top 3 languages.
*********************PHONE INTERVIEW QUESTIONS:*****************************
BASED ON WHAT YOU CHOSE, they will ask you to know certain things... I chose the software side, so my questions were focused on:
1.) Big-O and Algorithms
2.) C++, Java, C#
3.) System Design
4.) Sorting:
5.) Hashtables:
6.) Trees:
7.) Graphs:
9.) Discrete Math
10.) Operating Systems: processes, threads and concurrency issues. Know about locks and mutexes
BOOKS RECOMMENDED (by Google) :
1. Review of Basic Algorithms: Introduction to the Design and Analysis of Algorithms by Anany Levitin
2. Programming Interviews Exposed; Secrets to Landing Your Next Job (Programmer to Programmer) by John Mongan, Noah Suojanen, and Eric Giguere **HIGHLY RECOMMENDED**
Besides the questions listed below, they also asked:
--Which would be better for situation X, Merge Sort or Quick Sort?
Domande di colloquio [5]
Domanda 1
Write a function that finds the median of a set of three numbers, also find the Big O. Can it be done with only 2 comparisons, or do you need 3?
Ho sostenuto un colloquio presso Google (New York, NY)
Colloquio
1 coding assessment. If you pass, you get to the final round which consists of 4 rounds in one day. 3 technical and one behavioral. The algorithms I had was BFS, Min heaps, and backtracking(parentheses)
Got an OA first.
And an interview call.
Question was backtracking leetcode.
i would say a medium-hard question . I was able to solve it but still got rejected. I was hoping for second on site round. idk why .
But i think my interviewer is not in interested in my code like she is not even correcting me.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Google (Seattle, WA)
Colloquio
I applied online with no referral. First was an online coding challenge then 4 virtual onsite 45 minute interviews. I had a call with my recruiter to learn about the details of the interview process. They were 3 technical interviews and 1 behavioral.
