不是每个人都有时间做几百个 LeetCode 问题。这个开源项目就是为忙碌的工程师准备的免费技术面试准备材料,超过 500,000 人从这本手册中受益!
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
Go to file
Tay Yang Shun 1598e29aa7
Add in more questions to ask
7 years ago
algorithms Remove duplicate content 7 years ago
assets Rename logo to purge CDN cache 7 years ago
design Squash commit 7 years ago
domain Squash commit 7 years ago
front-end Tweak Front-End Job Interview Questions headings weight 7 years ago
non-technical Add in more questions to ask 7 years ago
preparing Fix more pronouns 7 years ago
utilities Categorize scripts 7 years ago
.editorconfig Squash commit 7 years ago
.travis.yml Add awesome_bot for automatically check if links are dead (#2) 7 years ago
CODE_OF_CONDUCT.md Create CODE_OF_CONDUCT.md 7 years ago
LICENSE Create LICENSE 7 years ago
README.md Make README more catchy 7 years ago

README.md

Tech Interview Handbook

Handbook to help you ace your next technical interview, with a focus on algorithms and the front end domain. System design questions are in-progress. Besides the usual algorithm questions, other awesome stuff include:

This handbook is pretty new and help from you in contributing content would be very much appreciated!

Motivations

While there are many awesome books like Cracking the Coding Interview and interview-related repositories on Github that contain a lot of algorithm questions, for more domain-specific and non-software engineering questions, there seems to be a lack in resources. This handbook aims to cover content beyond the typical algorithmic coding questions.

Contents

Contributing

There are no hard contributing guidelines at the moment as things are still in flux, might find a better approach to structure content, but we will figure out as we go along! Just contribute whatever that you think will help others. If you would like to contribute content for different domains, feel free to create an issue or submit a pull request and we can discuss further.