不准访问
- 积分
- 376
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2014-10-18
- 最后登录
- 1970-1-1
|
Thank you again for taking the time to speak with me today. I am really excited that we are moving you forward for the role of Software Engineer on the Site Reliability Engineering team!
General Interview Advice:
As promised, attached is the newest prep doc. As a reminder, your interview will focus on Algorithms/Data Structures and Coding in Java.
I am also adding a video to refer to - Interview Tips: Coding
Our interview style may be slightly different from other interviews you’ve had in the past; they tend to be highly technical. The interviewer may be interested in the specifics of your past projects, implementations, and how you arrived at your conclusions.
Many of the questions asked in Google interviews are open-ended because our engineers are looking to see how you engage the problem. Be sure to talk through your thought process about the questions you are asked, as well as your approach to problems and solutions. As discussed, here is an overview of the first round interview:. .и
1.You will be asked an open ended question. Ask clarifying questions in order to devise the requirements. Think about ways to improve the solution you'll present. In many cases, the first answer that springs to mind may need some refining. It is worthwhile to talk about your initial thoughts to a question, then take the time to compose a more efficient solution.
2. You will be asked to create and explain it in an algorithm.
3. Then convert it to a workable code. Be prepared to write at least 20 lines of Java in a live Google document. Approach all scripting as a coding exercise - this should be tactical coding - clean, rich, robust code.
(Hint: Don't worry about getting it perfect because by the time you know it, the 40 minutes will be up. Write what comes but then refine it later. Also make sure you consider corner cases and edge cases, production ready.)
4. Optimize the code, follow it with test cases, find any bugs.
A few topics that might be covered: algorithms, APIs, big O notation, quicksort, merge sort, heaps, binary tree, linked list, hash table, recursions, iteraters, lockings, powers of 2, corner cases, ,++I, I ++, fig - fog - dog
Quick Action Items:
→ Send me the most updated copy of your resume.
→ Send over the names of any Googlers who you know in your network who can provide a good reference!
Thanks in advance for this! If you have any questions or need any clarifications, feel free to contact me at any time.
|
|