程序员面试秘籍：揭秘Google、微软等大厂面试实战策略

113 浏览量更新于2024-07-27 收藏 1.5MB PDF 举报

《美国版程序员面试宝典》是一份极其珍贵的文档，专门为软件学习者和求职者精心编撰，提供了深入了解全球知名科技公司如Google、Microsoft、Amazon和Yahoo!面试过程的深入洞察。这本书由 Gayle Laakmann 编写，内容涵盖了150个技术面试问题及其解答，这些问题由业内专家精心设计，旨在帮助读者准备各种类型的面试挑战。书中特别强调了"Behind the scenes look at Google, Microsoft, Amazon, and Yahoo! interviews"部分，让读者能够从面试官的角度理解这些公司的期望，从而更有效地准备自己。"Interview War Stories"章节则分享了面试者的亲身经历，揭示了面试中的实际情景和策略，使求职者能够了解真实场景下的应对技巧。此外，这本书还按照逻辑结构分为十个章节，详细探讨了不同领域的面试问题： 1. **应用数学**：帮助应聘者回顾和掌握在面试中可能遇到的数学难题，如算法分析和数据结构。 2. **数组与哈希表**：考察编程基础，了解如何高效处理数据集合和查找。 3. **位操作**：测试应聘者对二进制和底层计算机原理的理解。 4. **脑筋急转弯**：这部分问题旨在考察逻辑思维和问题解决能力，通常涉及算法设计和抽象思考。 5. **C/C++**：针对那些偏重系统级编程的语言技能，包括内存管理、指针和数据结构实现。 6. **计数和组合**：涉及数学计算和概率问题，用于检验候选人的数学推理能力。 7. **数据库**：询问关于SQL查询、事务处理和数据库设计的知识。 8. **代码调试**：测试应聘者分析错误和优化代码的能力，通常包括性能调优和异常处理。 9. **游戏设计**：考察设计思维和问题解决在实际游戏场景中的应用。 10. **Java**：针对Java开发者，关注其语言特性和框架知识，以及高级编程技术。这本书还附带了"Cracking the Technical Interview"，由CareerCup.com独家提供给特定读者。版权信息强调了所有权利保留，访问权限可能受到限制，但通过这本书，求职者可以获取到宝贵的面试实战指南，提升自己的技术面试竞争力。《美国版程序员面试宝典》是任何想要在IT行业立足或提升面试技巧的人不可或缺的资源，它提供了实用的策略、案例和问题解答，有助于求职者在面试中脱颖而出。

XU-bp75mklu3ja@checkout.google.com

Interview War Stories

but we didn’t hire him, despite his excellent technical and personal skills. It was because he

insisted on meticulous written instructions for every step of the coding process. He wasn’t

going to make a suggestion or take any initiative – or blow his nose, for that matter – without

a mile-long audit trail and a dozen signatures. While he insisted that he worked that way for

reasons of quality (a defensible point), we got the impression that it had more to do with

butt-covering, and we simply didn’t have the time for that kind of bureaucracy. Terry would

have been an excellent t in a government or aerospace IT department, something that re-

quired ISO 9000 procedures. But he would have never t into our team; he would have been

a burden, not an asset.

exclusively for XU-bp75mklu3ja@checkout.google.com

Interview War Stories

My Spider Senses are Tingling

I can think of lots of interviews that just fell into the general category of weird and uncomfort-

able:

» The Java coder who apparently considered hygiene optional, and had the interview

room smelling like week-old blue cheese within ten minutes (my eyes were watering).

» The young fresh-out-of-college graduate with a tongue piercing that kept tick-tick-tick-

ing against his teeth as he talked (after half an hour, it was like Chinese water torture).

» The girl who wore an iPod through her interview, with the volume turned loud enough

that she actually had to ask the interviewers to repeat themselves a few times.

» The poor, hyper-nervous fellow who was sweating like a marathon runner for half an

hour.

» The girl who wore a T-shirt with an obscene political slogan to her interview.

» The guy who asked (seriously) at the end of his interview, “So, are there any hot chicks

in our department?”

Those are the interviews where we politely thank the people for their time, shake their hand

(except for the sweaty guy), then turn to each other after the door closes and ask – did that

really just happen?

Nobody is saying that you have to be a bland, boring robot in a Brooks Brothers suit and

tie. Remember, the interview team wants you to be “the one”, but they’re also very worried

about the possibility that you’re going to be more of a distraction than an asset. Don’t talk or

behave in a way that will set o their early warning radar. Whether or not somebody bothers

to behave professionally during an interview is often a very good indicator of what kind of

teammate they’re going to be.

Rudimentary social skills are part of the answer to “Would I have a beer with this guy?”, or at

least, “Will I mind working next to this guy for six months?” From the interviewer’s point of

view, they’re picking a neighbor that they’re going to live and work with 200 hours per week

for foreseeable future. Would you really want a neighbor that smelled like a hog rendering

plant?

1.1 Write a method to generate the nth Fibonacci number

_______________________________________________________________________pg 69

1.2 Write a method to count the number of 2’s between 0 and n.

EXAMPLE

input: 35

output: 14 [list of 2’s: 2, 12, 20, 21, 22, 23, 24, 25, 26, 27,

28, 29, 32]

_______________________________________________________________________pg 70

1.3 Given two lines on a Cartesian plane, determine whether the two lines would intersect.

_______________________________________________________________________pg 74

1.4 Given two squares on a two dimensional plane, nd a line that would cut these two

squares in half.

_______________________________________________________________________pg 75

1.5 Write an algorithm which computes the number of trailing zeros in n factorial.

EXAMPLE

input: 11

output: 2 (11! = 39916800)

_______________________________________________________________________pg 76

1. 6 Write a function that adds two numbers. You should not use + or any arithmetic operators.

_______________________________________________________________________pg 77

1. 7 Write a method to implement *, - , / operations. You should use only the + operator.

_______________________________________________________________________pg 79

1.8 Design an algorithm to nd the kth number such that the only prime factors are 3, 5,

and 7.

_______________________________________________________________________pg 81

1.9 A circus is designing a tower routine consisting of people standing atop one another’s

shoulders. For practical and aesthetic reasons, each person must be both shorter and

lighter than the person below him or her. Given the heights and weights of each person

in the circus, write a method to compute the largest possible number of people in such

a tower.

EXAMPLE:

Input(ht, wt) : (65, 100) (70, 150) (56, 90) (75, 190) (60, 95) (68,

110)

Output: The longest tower is length 6 and includes from top to bot-

tom: (56,90) (60,95) (65,100) (68,110) (70,150) (75,190)

_______________________________________________________________________pg 84

1.10 Given a two dimensional graph with 6000 points on it, nd a line which passes the most

number of points.

_______________________________________________________________________pg 86

Applied Mathematics CHAPTER-1

剩余276页未读，继续阅读

Crystal19910330

粉丝: 0
资源: 3

程序员面试秘籍：揭秘Google、微软等大厂面试实战策略

程序员面试金典第六版，英文版

android和java面试大全集

程序员面试宝典：实战技巧与经典题解

程序员面试宝典精华：前两章详解

Java版水果管理系统源码-learn-repository:进击的程序员之路上各种优秀资料、神器及框架汇总

zxing.java源码解析-be-a-professional-programmer:成为一名专业的程序员

zxing.java源码解析-Be-a-Professional-Programmer:成为专业程序员路上用到的各种优秀资料、神器及框架htt

zxing.java源码解析-coder:程序之路-作为一个程序员的自我修养:face_with_tears_of_joy:

linux c++ 服务器端开发面试必看书籍整理

编程面试宝典：揭开求职成功秘诀（第三版）

最新资源