Carefully curated content 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 includes:
- How to prepare for coding interviews
- Algorithm tips and the best practice questions categorized by topic
- "Front-end Job Interview Questions" answers
- Interview formats of the top tech companies
- Behavioral questions categorized by companies
- Good questions to ask your interviewers at the end of the interviews
This handbook is pretty new and help from you in contributing content would be very much appreciated!
There are so many awesome books like Cracking the Coding Interview and interview-related repositories out there on GitHub, what makes this repository different? The difference is that many existing interview repositories contain mainly links to external resources whereas this repository contains top quality curated content directly for your consumption.
Also, existing resources focus mainly on algorithm questions, and lack in coverage for more domain-specific and non-technical questions. This handbook aims to cover content beyond the typical algorithmic coding questions. 😎
- Preparing for a Coding Interview
- Algorithm Questions - Questions categorized by topics
- Design Questions
- Front-end Study Notes - Summarized notes on the various aspects of front-end
- Non-Technical Tips - Random non-technical tips that cover behavioral and psychological aspects, interview formats and "Do you have any questions for me?"
- Utilities - Snippets of algorithms/code that will help in coding questions.
There are no formal contributing guidelines at the moment as things are still in flux and we might find a better approach to structure content as we go along. You are welcome to contribute whatever you think will be helpful to fellow engineers. 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.