Google Software Engineer 收入

  • 收入 - 10/10
    10/10
  • 工時合理 - 5/10
    5/10
  • 晉升前景 - 9/10
    9/10
  • 快樂指數 - 10/10
    10/10
8.5/10

收入:

Software Engineer: 月收入$200,000 + yearly bonus” – Anonymous – 4.11.2016

 

工時合理:

“正常日子:11:00am-4:00pm

繁忙日子:10:00am-5:00pm“-  Anonymous – 4.11.2016



 

晉升前景:

It is OK.–  Anonymous – 4.11.2016

 

工作範圍:

Software Engineer in Google. “-  Anonymous – 4.11.2016

 

快樂指數:

Very happy“-  Anonymous – 4.11.2016

 

入職攻略:

Direct onsite because I interviewed in the past and did well that time. From the time I sent my resume to interview day: 2 weeks. From interview day to offer over the phone: 2 weeks.

The syllabus for the interviews is very clear and simple:
1) Dynamic Programming
2) Super recursion (permutation, combination,…2^n, m^n, n!…etc. type of program. (NP hard, NP programs)
3) Probability related programs
4) Graphs: BFS/DFS are usually enough
5) All basic data structures from Arrays/Lists to circular queues, BSTs, Hash tables, B-Trees, and Red-Black trees, and all basic algorithms like sorting, binary search, median,…
6) Problem solving ability at a level similar to TopCoder Division 1, 250 points. If you can consistently solve these, then you are almost sure to get in with 2-weeks brush up.
7) Review all old interview questions in Glassdoor to get a feel. If you can solve 95% of them at home (including coding them up quickly and testing them out in a debugger + editor setup), you are in good shape.
8) Practice coding–write often and write a lot. If you can think of a solution, you should be able to code it easily…without much thought.
9) Very good to have for design interview: distributed systems knowledge and practical experience.
10) Good understanding of basic discrete math, computer architecture, basic math.
11) Coursera courses and assignments give a lot of what you need to know.
12) Note that all the above except the first 2 are useful in “real life” programming too!

Interview 1:
Graph related question and super recursion

Interview 2:
Design discussion involving a distributed system with writes/reads going on at different sites in parallel.

Interview 3:
Array and Tree related questions

Interview 4:
Designing a simple class to do something. Not hard, but not easy either. You need to know basic data structures very well to consider different designs and trade-offs.

Interview 5:
Dynamic programming,
Computer architecture and low level perf. enhancement question which requires knowledge of Trees, binary search, etc.

At the end, I wasn’t tired and rather enjoyed the discussions. I think the key was long term preparation and time spent doing topcoder for several years (on and off as I enjoy solving the problems).

Conclusion: “It’s not the best who win the race; it’s the best prepared who win it.”
Show Less“-  Anonymous – 4.11.2016


轉載請註明StealJobs.com及原作者。 StealJobs全面透露各行各業人工,工時,晉升前景,以及入行攻略,歡迎匿名提供收入資料

Employers or publishers who object to the above content please read SJ Community Guidelines and contact us via email or Facebook message. The above content is mere opinion of the submitter(s), not facts, not from an official source, and might be inaccurate.
如對本網任何內容有任何意見或投訴,請按此聯絡本網,本網會盡快為您處理問題。 


立即加入StealJobs@FB 更多90後上位攻略

以下係默默支持SJ的廣告商,啱用去睇:




按下圖,立即向StealJobs匿名爆料人工資料 Submit Job Review

comments

Tags: , , ,

Comments are closed.

Share
Hide Buttons