From 7fbd660ecfa4f7ec137f807475f37a246f3e1d49 Mon Sep 17 00:00:00 2001
From: Andrew <polizz@users.noreply.github.com>
Date: Mon, 2 Oct 2017 23:49:09 -0500
Subject: [PATCH 01/71] Flesh out glossary, add references, convert links to
 md, add transpilation and fp info. (#24)

---
 front-end/javascript.md | 29 +++++++++++++++++------------
 1 file changed, 17 insertions(+), 12 deletions(-)

diff --git a/front-end/javascript.md b/front-end/javascript.md
index 9a3bc5e7..30bd8e3f 100644
--- a/front-end/javascript.md
+++ b/front-end/javascript.md
@@ -12,25 +12,26 @@ WIP.
 
 ## Glossary
 
-- **Closure** - TBD
+- **Closure** - "Closure is when a function is able to remember and access its lexical scope even when that function is executing outside its lexical scope." - [YDKJS](https://github.com/getify/You-Dont-Know-JS/blob/master/scope%20%26%20closures/ch5.md)
 - **Event Loop** - The event loop is a single-threaded loop that monitors the call stack and checks if there is any work to be done in the message queue. If the call stack is empty and there are callback functions in the message queue, a message is dequeued and pushed onto the call stack to be executed.
-- **Hoisting** - TBD
-- **Promise** - TBD
+- **Hoisting** - "Wherever a var appears inside a scope, that declaration is taken to belong to the entire scope and accessible everywhere throughout." - [YDKJS](https://github.com/getify/You-Dont-Know-JS/blob/master/up%20%26%20going/ch2.md#hoisting)
+- **Promise** - "The Promise object represents the eventual completion (or failure) of an asynchronous operation, and its resulting value." - [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise)
+  - Promises can contain an immediate value.
 - **Prototype** - TBD
-- **This** - The `this` keyword does not refer to the function in which it is used or it's scope. It refers to the object on which a function is being executed and depends entirely on the call-site of the function.
+- **This** - The `this` keyword does not refer to the function in which `this` is used or that function's scope. Javascript uses [4 rules](https://github.com/getify/You-Dont-Know-JS/blob/master/this%20%26%20object%20prototypes/ch2.md#determining-this) to determine if `this` will reference an arbitrary object, *undefined* or the *global* object inside a particular function call.
 
 ## Core Language
 
 ### Variables
 
-- https://github.com/getify/You-Dont-Know-JS/blob/master/types%20&%20grammar/README.md#you-dont-know-js-types--grammar
+- Reference: [Types and Grammar](https://github.com/getify/You-Dont-Know-JS/blob/master/types%20%26%20grammar/ch1.md)
 - Types
 - Scopes
-- Coercion
+- [Coercion](https://github.com/getify/You-Dont-Know-JS/blob/master/up%20%26%20going/ch2.md#coercion)
 
 ### Functions
 
-- https://github.com/getify/You-Dont-Know-JS/blob/master/scope%20&%20closures/README.md#you-dont-know-js-scope--closures
+- Reference: [this & Object Prototypes](https://github.com/getify/You-Dont-Know-JS/blob/master/scope%20%26%20closures/ch3.md)
 - Declaration vs Expression
 - Closures
 - `.call`, `.apply` and `.bind`
@@ -39,7 +40,7 @@ WIP.
 
 ### Prototypes and Objects
 
-- Reference: https://github.com/getify/You-Dont-Know-JS/blob/master/this%20%26%20object%20prototypes/README.md
+- Reference: [this & Object Prototypes](https://github.com/getify/You-Dont-Know-JS/blob/master/scope%20&%20closures/README.md#you-dont-know-js-scope--closures)
 - Prototype chain
 - `this` keyword
   - https://rainsoft.io/gentle-explanation-of-this-in-javascript/
@@ -50,16 +51,16 @@ WIP.
 
 ### Async
 
-- Reference: https://github.com/getify/You-Dont-Know-JS/blob/master/async%20&%20performance/README.md#you-dont-know-js-async--performance
-- `setTimeout` and `setInterval`
+- Reference: [Async and Peformance](https://github.com/getify/You-Dont-Know-JS/blob/master/async%20&%20performance/README.md#you-dont-know-js-async--performance)
+- `setTimeout`, `setInterval` and event loop
+  - [setImmediate() vs nextTick() vs setTimeout(fn,0)](http://voidcanvas.com/setimmediate-vs-nexttick-vs-settimeout/)
 - Event Loop
-  -
 - Debounce and Throttle
   - Throttling enforces a maximum number of times a function can be called over time.
   - Debouncing enforces that a function not be called again until a certain amount of time has passed without it being called.
   - https://css-tricks.com/debouncing-throttling-explained-examples/
 - Callbacks
-- Promises
+- [Promises](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise)
 
 **Reference**
 
@@ -96,7 +97,11 @@ WIP.
 - First, in strict mode a short list of identifiers become reserved keywords. These words are `implements`, `interface`, `let`, `package`, `private`, `protected`, `public`, `static`, and `yield`. In strict mode, then, you can't name or use variables or arguments with these names.
 - Second, strict mode prohibits function statements not at the top level of a script or function.
 
+## Transpilation: TBD
+
 ## Useful Links
 
 - https://medium.com/javascript-scene/10-interview-questions-every-javascript-developer-should-know-6fa6bdf5ad95#.l2n8icwl4
 - https://github.com/mbeaudru/modern-js-cheatsheet
+- [Functional Programming in Javascript - Javascript Allonge](https://leanpub.com/javascriptallongesix/read)
+- [Dr. Frisby's Mostly Adequate Guide to Functional Programming](https://drboolean.gitbooks.io/mostly-adequate-guide/content/)

From 647d30d0cf774e20a80b38c5c5024d4311025315 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Tue, 3 Oct 2017 15:24:07 +0800
Subject: [PATCH 02/71] Elaborate on the why and who

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index b6057b73..8b50bb20 100644
--- a/README.md
+++ b/README.md
@@ -26,11 +26,11 @@ This handbook is pretty new and help from you in contributing content would be v
 
 ## Why do I want this?
 
-This repository has content that covers all phases of a technical interview; from applying for a job to passing the interviews to offer negotiation. Technically competent candidates might still find the non-technical content helpful as well.
+This repository has *practical* content that covers all phases of a technical interview; from applying for a job to passing the interviews to offer negotiation. Technically competent candidates might still find the non-technical content helpful as well.
 
 ## Who is this for?
 
-Anybody who wants to land a job at a tech company but is new to technical interviews, or seasoned engineers who have not been on the other side of the interviewing table in a while and wants to get back into the game.
+Anybody who wants to land a job at a tech company but is new to technical interviews, seasoned engineers who have not been on the other side of the interviewing table in a while and wants to get back into the game, or anyone who wants to be better at technical interviewing.
 
 ## How is this repository different?
 

From cbe05deb1d84154b4e73d75caf38221285609f57 Mon Sep 17 00:00:00 2001
From: Juribiyan <snivy@ponyasha.ru>
Date: Tue, 3 Oct 2017 18:54:05 +0500
Subject: [PATCH 03/71] Fixed errors in "undefined and undeclared" section
 (#27)

---
 front-end/interview-questions.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index a4b36c8c..7f2b9fa6 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -675,12 +675,12 @@ console.log(foo == null); // true. Wrong, don't use this to check!
 
 function bar() {}
 var baz = bar();
-console.log(baz === undefined); // undefined
+console.log(baz); // undefined
 ```
 
 A variable that is `null` will have been explicitly assigned to the `null` value. It represents no value and is different from `undefined` in the sense that it has been explicitly assigned. To check for `null,` simply compare using the strict equality operator. Note that like the above, you should not be using the abstract equality operator (`==`) to check, as it will also return `true` if the value is `undefined`.
 
-```
+```js
 var foo = null;
 console.log(foo === null); // true
 

From aabf8917705e06b78f9dd4e3bf135488de4c631c Mon Sep 17 00:00:00 2001
From: Alex Prut <mail@alexprut.com>
Date: Tue, 3 Oct 2017 18:48:31 +0200
Subject: [PATCH 04/71] Added to Front-End Interview questions: more answers to
 question: What kind of things must you be wary of when designing or
 developing for multilingual sites? (#28)

---
 front-end/interview-questions.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index 7f2b9fa6..fd022388 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -84,6 +84,7 @@ In the back end, the HTML markup will contain `i18n` placeholders and content fo
 - Be mindful of how colors are perceived - Colors are perceived differently across languages and cultures. The design should use color appropriately.
 - Formatting dates and currencies - Calendar dates are sometimes presented in different ways. Eg. "May 31, 2012" in the U.S. vs. "31 May 2012" in parts of Europe.
 - Do not concatenate translated strings - Do not do anything like `"The date today is " + date`. It will break in languages with different word order. Using template parameters instead.
+- Language reading direction - In English, we read from left-to-right, top-to-bottom, in traditional Japanese, text is read up-to-down, right-to-left.
 
 ###### References
 

From 1dfdc57084f1b6dd00a15c38deefb9d9ecf3d1be Mon Sep 17 00:00:00 2001
From: Stephen Kempin <SKempin@users.noreply.github.com>
Date: Wed, 4 Oct 2017 11:02:33 +0100
Subject: [PATCH 05/71] Grammar correction (#31)

Correcting full stop typo to comma.
---
 front-end/interview-questions.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index fd022388..9a04d1f5 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -621,7 +621,7 @@ For an in-depth explanation, do check out his [article on Medium](https://codebu
 
 ### Explain how prototypal inheritance works
 
-This is an extremely common JavaScript interview question. All JavaScript objects have a `prototype` property, that is a reference to another object. When a property is accessed on an object and if the property is not found on that object, the JavaScript engine looks at the object's `prototype`. and the `prototype`'s `prototype` and so on, until it finds the property defined on one of the `prototype`s or until it reaches the end of the prototype chain. This behaviour simulates classical inheritance, but it is really more of [delegation than inheritance](https://davidwalsh.name/javascript-objects).
+This is an extremely common JavaScript interview question. All JavaScript objects have a `prototype` property, that is a reference to another object. When a property is accessed on an object and if the property is not found on that object, the JavaScript engine looks at the object's `prototype`, and the `prototype`'s `prototype` and so on, until it finds the property defined on one of the `prototype`s or until it reaches the end of the prototype chain. This behaviour simulates classical inheritance, but it is really more of [delegation than inheritance](https://davidwalsh.name/javascript-objects).
 
 ###### References
 

From 457ea288e23af0453d7942ef4993d8e648df4047 Mon Sep 17 00:00:00 2001
From: Cameron Burwell <cburwell@users.noreply.github.com>
Date: Wed, 4 Oct 2017 10:00:29 -0700
Subject: [PATCH 06/71] Added Elevator Pitch section (#30)

---
 non-technical/self-introduction.md | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)

diff --git a/non-technical/self-introduction.md b/non-technical/self-introduction.md
index 30a95e1d..510b089a 100644
--- a/non-technical/self-introduction.md
+++ b/non-technical/self-introduction.md
@@ -5,6 +5,23 @@ You can rephrase the question like this:
 
 "Tell me about your journey into tech. How did you get interested in coding, and why was web development a good fit for you? How is that applicable to our _____ role or company goals?"
 
+### The Elevator Pitch
+
+The Elevator Pitch is an indispensable tool for you as you move forward in your career. An Elevator Pitch is just that -- you pitch yourself to an executive that you want to impress and only have a short elevator ride to do so. Whether you're at a job fair with hundreds of other candidates and you have limited time or you are simply explaining who you are to a potential connection or client, it is important to be able to clearly and accurately describe your knowledge and skillset quickly and succinctly. Here are some tips to develop a good Elevator Pitch:
+
+- Sell yourself
+  - The whole point of this is to get you a job or make a connection that benefits your career.
+  - Tell them who you are, who you work for (or school and major), and what you do.
+- KISS (Keep It Simple, Stupid)
+  - Tell them some highlights from your favorite / most impressive projects.
+    - Do not delve into the depths of how you reverse engineered a game and decrypted a packet to predict when to use your DKP on a drop. Tell them the executive summary: "I reverse engineered X game by decrypting Y packet to predict Z." If this catches their interest, they *will* ask further questions on their own.
+- Why do *they* want *you*?
+  - This is where you use your knowledge of the company, knowledge of their technology stack(s), your unique talent that they want, etc. in order to solidify your ability to contribute to their company.
+- PRACTICE!
+  - Lastly, you must practice your pitch! Having a great, succinct summary of your skills only helps if you can actually deliver it rapidly! You should practice keeping a quick but easy-to-follow pace that won't overwhelm them but won't bore them. It's a precarious balance, but can be ironed out with practice.
+  
+Having an Elevator Pitch on hand is a great way to create a network and happen upon new job opportunities. There will often be times where you can't prepare for an interview or meeting, and it is incredibly handy to have a practiced pitch.
+
 ###### References
 
 - [8 Secrets to Software Engineer Self Introduction](http://blog.gainlo.co/index.php/2016/10/14/8-secretes-software-engineer-self-introduction)

From 969538bd5ce555d11707f70c75adb3737f16eef8 Mon Sep 17 00:00:00 2001
From: Tay Yang Shun <tay.yang.shun@gmail.com>
Date: Thu, 5 Oct 2017 12:59:49 +0800
Subject: [PATCH 07/71] Repository structure clean up

---
 README.md                                                   | 6 +++---
 non-technical/{format.md => interview-formats.md}           | 0
 non-technical/{psychological.md => psychological-tricks.md} | 0
 non-technical/self-introduction.md                          | 4 ++--
 4 files changed, 5 insertions(+), 5 deletions(-)
 rename non-technical/{format.md => interview-formats.md} (100%)
 rename non-technical/{psychological.md => psychological-tricks.md} (100%)

diff --git a/README.md b/README.md
index 8b50bb20..97982d0b 100644
--- a/README.md
+++ b/README.md
@@ -18,7 +18,7 @@ Carefully curated content to help you ace your next technical interview, with a
 - [How to prepare](preparing) for coding interviews
 - [Algorithm tips and the best practice questions](algorithms) categorized by topic
 - ["Front-end Job Interview Questions" answers](front-end/interview-questions.md)
-- [Interview formats](non-technical/format.md) of the top tech companies
+- [Interview formats](non-technical/interview-formats.md) of the top tech companies
 - [Behavioral questions](non-technical/behavioral.md) categorized by companies
 - [Good questions to ask your interviewers](non-technical/questions-to-ask.md) at the end of the interviews
 
@@ -47,8 +47,8 @@ Also, existing resources focus mainly on algorithm questions, and lack in covera
   - [Front-end Job Interview Questions and Answers](front-end/interview-questions.md) 🔥⭐
 - **[Non-Technical Tips](non-technical)** - Random non-technical tips that cover behavioral and psychological aspects, interview formats and "Do you have any questions for me?"
   - [Behavioral Questions](non-technical/behavioral.md)
-  - [Interview Formats](non-technical/format.md)
-  - [Psychological Tricks](non-technical/psychological.md)
+  - [Interview Formats](non-technical/interview-formats.md)
+  - [Psychological Tricks](non-technical/psychological-tricks.md)
   - [Questions to Ask](non-technical/questions-to-ask.md)
   - [Negotiation Tips](non-technical/negotiation.md)
 - **[Utilities](utilities)** - Snippets of algorithms/code that will help in coding questions.
diff --git a/non-technical/format.md b/non-technical/interview-formats.md
similarity index 100%
rename from non-technical/format.md
rename to non-technical/interview-formats.md
diff --git a/non-technical/psychological.md b/non-technical/psychological-tricks.md
similarity index 100%
rename from non-technical/psychological.md
rename to non-technical/psychological-tricks.md
diff --git a/non-technical/self-introduction.md b/non-technical/self-introduction.md
index 510b089a..6f78a8fc 100644
--- a/non-technical/self-introduction.md
+++ b/non-technical/self-introduction.md
@@ -14,12 +14,12 @@ The Elevator Pitch is an indispensable tool for you as you move forward in your
   - Tell them who you are, who you work for (or school and major), and what you do.
 - KISS (Keep It Simple, Stupid)
   - Tell them some highlights from your favorite / most impressive projects.
-    - Do not delve into the depths of how you reverse engineered a game and decrypted a packet to predict when to use your DKP on a drop. Tell them the executive summary: "I reverse engineered X game by decrypting Y packet to predict Z." If this catches their interest, they *will* ask further questions on their own.
+  - Do not delve into the depths of how you reverse engineered a game and decrypted a packet to predict when to use your DKP on a drop. Tell them the executive summary: "I reverse engineered X game by decrypting Y packet to predict Z." If this catches their interest, they *will* ask further questions on their own.
 - Why do *they* want *you*?
   - This is where you use your knowledge of the company, knowledge of their technology stack(s), your unique talent that they want, etc. in order to solidify your ability to contribute to their company.
 - PRACTICE!
   - Lastly, you must practice your pitch! Having a great, succinct summary of your skills only helps if you can actually deliver it rapidly! You should practice keeping a quick but easy-to-follow pace that won't overwhelm them but won't bore them. It's a precarious balance, but can be ironed out with practice.
-  
+
 Having an Elevator Pitch on hand is a great way to create a network and happen upon new job opportunities. There will often be times where you can't prepare for an interview or meeting, and it is incredibly handy to have a practiced pitch.
 
 ###### References

From 621472ecb6bb929372683190bf4a79cfb3b3139b Mon Sep 17 00:00:00 2001
From: Tay Yang Shun <tay.yang.shun@gmail.com>
Date: Thu, 5 Oct 2017 13:43:45 +0800
Subject: [PATCH 08/71] Fix typo in HTML Interview Questions

---
 front-end/interview-questions.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index 9a04d1f5..40851c15 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -154,7 +154,7 @@ Note: The `async` and `defer` attrib­utes are ignored for scripts that have no
 
 Putting `<link>`s in the head is part of the specification. Besides that, placing at the top allows the page to render progressively which improves user experience. The problem with putting stylesheets near the bottom of the document is that it prohibits progressive rendering in many browsers, including Internet Explorer. Some browsers block rendering to avoid having to repaint elements of the page if their styles change. The user is stuck viewing a blank white page. It prevents the flash of unstyled contents.
 
-**Placing `<scripts>`s just before `<body>`**
+**Placing `<scripts>`s just before `</body>`**
 
 `<script>`s block HTML parsing while they are being downloaded and executed. Downloading the scripts at the bottom will allow the HTML to be parsed and displayed to the user first.
 

From 1069ad12bc7e2fd6efd757bd14980c16a19af4fb Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Thu, 5 Oct 2017 14:07:59 +0800
Subject: [PATCH 09/71] Add resume tips section (#33)

* Add resume tips section

* Add resume tips section
---
 front-end/interview-questions.md |   2 +-
 non-technical/resume.md          | 144 +++++++++++++++++++++++++++++++
 2 files changed, 145 insertions(+), 1 deletion(-)
 create mode 100644 non-technical/resume.md

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index 40851c15..d1bc3a0b 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -154,7 +154,7 @@ Note: The `async` and `defer` attrib­utes are ignored for scripts that have no
 
 Putting `<link>`s in the head is part of the specification. Besides that, placing at the top allows the page to render progressively which improves user experience. The problem with putting stylesheets near the bottom of the document is that it prohibits progressive rendering in many browsers, including Internet Explorer. Some browsers block rendering to avoid having to repaint elements of the page if their styles change. The user is stuck viewing a blank white page. It prevents the flash of unstyled contents.
 
-**Placing `<scripts>`s just before `</body>`**
+**Placing `<script>`s just before `</body>`**
 
 `<script>`s block HTML parsing while they are being downloaded and executed. Downloading the scripts at the bottom will allow the HTML to be parsed and displayed to the user first.
 
diff --git a/non-technical/resume.md b/non-technical/resume.md
new file mode 100644
index 00000000..0db3c51b
--- /dev/null
+++ b/non-technical/resume.md
@@ -0,0 +1,144 @@
+Resume
+==
+
+The following content is by Christina Ng and rephrased for the purpose of this handbook. You can follow her on [Medium](https://medium.com/@christinang89) or [Quora](https://www.quora.com/profile/Christina-Ng).
+
+## Table of Contents
+
+  1. [How Your Resume is Screened](#how-your-resume-is-screened)
+  1. [10 Ways To Improve Your Resume](#10-ways-to-improve-your-resume)
+
+## How Your Resume is Screened
+
+While many engineers can be rather qualified for the role they are applying for, they miss out on getting a shot at the interview as they might never get past resume screening. The main issue was that they do not understand how recruiters worked.
+
+Before writing your resume, it is important to understand the recruiting structure and how recruiting is done.
+
+### The Skill Set Checklist
+
+Before opening up a position/starting the search for candidates, I usually consult very closely with the team manager/decision maker to find out the specific skill sets that are relevant for the position. These skill sets are typically grouped into "Must have", "Good to have", "Special bonus".
+
+- "Must have" — Typically, most of the must-haves include a degree (or not) in a relevant technical field, some years (or not) of experience in a particular programming language or technology.
+- "Good to have" — Includes experience/familiarity with secondary languages/technologies which may not be directly relevant to what the candidate would be working on, but could be required due to some interfacing with other components of the project. It could also include softer skills such as being a good team player, clear communication, etc.
+- "Special bonus" — Recognized skill sets/experiences which are difficult to come by. Probably not a requirement, but would definitely be useful for the position.
+
+Now that I am armed with this list, the search for candidates begin.
+
+Typically, I do not seek that "one perfect candidate". What I seek for is the "best fit candidate". The search is essentially a numbers game. I know that for a specific job posting, there would perhaps be X applicants. At each stage of the interview process, some percentage of the candidates will be eliminated, leaving only a final Y% of the initial pool to choose from. Since Y tends to be a rather small number, recruiters will try to maximize X.
+
+### The 10 Seconds Glance
+
+When I am looking at your resume, I am doing a keyword match against the skill set checklist. If I see a good amount of the right keywords in your resume, it is a pass. If I need to spend more than 10 seconds trying to figure out what you are writing about, it is a fail. If I see an excessive amount of keywords (much looking like spam), it signals a red flag and goes into the "maybe". Depending on whether I think I have enough candidates for the day, you could eventually go into the pass or fail stack.
+
+There are lots of articles writing about how recruiters only spend an average of about 10 seconds to screen each resume. The news is, this is true because resume screening such a menial, robotic and repetitive task. In fact, many applicant tracking systems (ATS) now are so advanced that they can parse your resume automatically, search for specific keywords in your resume, and score your resume based on the weights pre-assigned to each keyword.
+
+Finding a job is a two-way fit — the company wants someone with the relevant skills required, but it is also important for the applicant to fit in the company culture, and be able to gain something out of his stint. Hence, honesty is the single most important criteria in a resume.
+
+There is a delicate balance between finding the right job vs. finding a job. Getting rejected does not always mean you are not good enough. Sometimes, it just means you are not a right fit for what the company is looking for.
+
+When hiring fresh grads, I know that many of them will not have as much experience as someone who has years of industry experience. Hence, I would look out more for soft skills, such as attention to detail, initiative, passion, ability to get things done, etc. Note: this applies only if you have met the minimum threshold of proficiency/competency in the skill set checklist.
+
+## 10 Ways To Improve Your Resume
+
+Now that you are aware of how recruiters screen your resume, here are 10 actionable ways you can do to improve your resume.
+
+#### 1. Cover letter
+
+I've often received resumes with no cover letters, and I am perfectly fine with it. If you ask me, it is better to have no cover letter than to have a bad cover letter, especially if your cover letter is a "templated" content. An effective cover letter needs to highlight the fit between the job requirements and your skills/experiences. Do not just tell me what you have done in your cover letter; Tell me how it is a fit for what I am looking for.
+
+Some small nitpicks:
+
+- Make sure that the cover letter is addressed to the right person (either the name of the recruiter if it is known, or to a generic hiring manager) and company.
+- Run a spell check.
+
+#### 2. Length of resume
+
+Your resume should be kept to 1 page or a MAXIMUM of 2 pages. Include only your most recent and relevant experiences.
+
+Information that a recruiter wants to know:
+
+- Name, email, contact number.
+- Education details: College, Major, GPA, Sample classes (optional, but if you list, make sure its classes that you scored well in and are relevant to your area of interest), academic awards, availability.
+- If you have studied abroad, you can list that too.
+- Projects that you have worked on.
+- Work experience/co-curricular activities.
+- Skills/other interests.
+- Street cred - GitHub/StackOverflow/LinkedIn profile (optional, but highly recommended).
+
+Information nobody needs to know:
+
+- Address, home phone number, gender, religion, race, marital status, etc etc.
+- Elementary, middle, high school.
+- Your low GPA.
+- Anything less recent than 3-4 years unless they are valid job experiences.
+- Anything about your parents/siblings, their names, occupation, etc.
+- Your life story.
+- Anything not relevant to the job you are applying for (eg. that you have a driving license when you are applying to be a programmer).
+
+Ideally, keep it short, concise, but as detailed as possible.
+
+####  3. GPA does matter
+
+Everyone wants the cream of the crop. In the absence of a standardized test, GPA serves as that indicator. **While GPA may not necessarily be a good indication of how well you can code, a high GPA would definitely put you in a more favorable position to the recruiter.**
+
+If your GPA is rather low, but you have loads of technical experiences, you can try not listing your GPA in the resume. This kinda "forces" the recruiter to read through your projects/job experience, and perhaps grant you a first interview. If you manage to impress them, who cares about your GPA? But if your GPA is low and you do not have skills for the job... maybe you should work on one of them and revisit job applications later.
+
+In a different scenario, some students have low GPA, but it might be due to some irrelevant classes which they did badly in. E.g. Student X is scoring A for all his programming classes, but did not do well for his language classes. If I am hiring a developer, Student X would still be a suitable candidate despite his low GPA. In such cases, it might even be recommended to attach a transcript along with the resume.
+
+Also, when you list your GPA/results, try to benchmark it. Instead of simply listing 4.6, write 4.6/5.0 (First Class Honors or Summa Cum Laude). To the recruiter, 4.6 does not mean anything if he/she is not familiar with your grading system.
+
+#### 4. Be clear about your objectives
+
+Are you looking for a summer internship/full-time employment? What position are you applying for? Read the job description and know the job you are applying for!!
+
+**"Work experience" does not mean any work experience; it means *relevant* work experience.** If you are applying for a developer position, the recruiter is not interested to know that you were a student escort for girls walking back to their apartments at night, nor that you were a cashier at Starbucks. You would be better off writing about the project you did for some programming class - yes, even if it was just a school project. Tailor your experiences and projects according to the job you are applying for. Pick relevant details to emphasize on and do not be hesitant to drop stuff completely if they are totally irrelevant. Quality over quantity.
+
+- Make sure the description is comprehensive. Avoid writing "Software engineering intern - write code". You are better off not writing anything.
+- Based on my experience, most fresh grads do not have extremely relevant job experience (unless you are lucky to have scored a really rewarding internship). For developer positions, I think it is ok to not have any job experience and just list projects.
+
+#### 5. Reverse chronological order
+
+Always list your resume in reverse chronological order - the most recent at the top. Recruiters are more interested in what you have worked on recently than what you worked on 3 years ago. Chances are, you probably forgot the details too anyway.
+
+#### 6. Make sure you are contactable
+
+- Get a proper email account with ideally your first name and last name, eg. "john.doe@gmail.com" instead of "angrybirds88@gmail.com".
+- If you are using your school's .edu email, try to have an alias like "john.doe@xxx.edu" instead of "a002342342@xxx.edu".
+- Avoid emails like "me@christi.na" or "admin@[mycooldomain].com" -- because it is very prone to typo errors.
+- Make sure the number you have listed is the best way to reach you. The last thing you want is to miss the call from the recruiter because you typed the wrong number, or you are not available on that number during office hours (most probably the times the recruiter will call).
+
+#### 7. Formatting/Design
+
+- Be consistent about the way you format your resume. Italics, underline, bold, and how they are used.
+- Keep to a single standard font (avoid fancy fonts like Comic Sans or whatever) and do not have too many varying styles/font sizes/color
+- Be consistent about the way you list your dates (eg. May 2011 - Aug 2011). Avoid using numerals for both month and date due to the difference in style for MMDD and DDMM in different countries. Dates like "Aug 2011 - June 12" just show that you have zero attention to detail.
+- Unless you are applying for a design job, just stick to the standard "table" style for the resume. There is nothing wrong with the standard style, and it helps the recruiter screen your resume more efficiently since they asre trained through experience to read that format. It would also help in the automatic scoring by the ATS. The last thing you want is for your application to be rejected because the system could not parse your resume for it to be scored. That said, I am not discouraging you from coming up with your own design. It is nice to read something different. Just be aware of the risks you could be taking.
+- Name your file `firstname_lastname_resume.pdf` instead of `resume.pdf - it is easier for recruiters to search/forward.
+- PDF preferred over Word doc.
+- Be consistent about bullet points.
+- Your resume should not look sparse. (Come on, it is only 1 page!) If you really have trouble filling it up, you are either not thinking hard enough, or not doing enough. In the case of the latter, consider working on your personal projects (i.e. stuff you can post on GitHub). That said, do not write stuff just to fill space. Read point 4.
+- This should be common sense, but do not commit fraud, i.e. apply for the same job using a different name, or using your friend's resume to apply for the same job. Some ATS issues an indicator if they suspect the application to be a duplicate.
+
+#### 8. Listing Your skills
+
+It is useful to list your relevant skills in a quick summary section for easy reading/matching. However, many people make the mistake of listing as many skills/programming languages in the resume as possible. This may get you through the ATS scoring, but it definitely would not leave a good impression on the recruiter - the actual human reading your resume and deciding whether to call you up for an interview!
+
+Ideally, if your resume is good enough, the recruiter should already know what you are proficient in. The skills section is just a quick summary/reiteration. **Listing a bunch of technologies you claim you know without actually showing how you have worked with them is pointless.**
+
+#### 9. Projects
+
+- Ideally, 1-2 lines about the project, 2-3 lines about your role, what technologies you used, what you did, your learning, etc etc. These can be Final Year Projects, Research projects, projects for a particular class, freelance projects, or just personal projects (ie. GitHub stuff).
+- Ideally, 2 to 3 projects that align with your interests/position you are applying for.
+- Avoid using titles such as "Project for [module code]". Sorry, the recruiter has no idea what class is represented by the module code.
+Ideally, you want the project section to demonstrate your personality and skills, and be the talking point during the interview.
+
+#### 10. Online profile/other interests
+
+Here's the news - Recruiters do search for your name! Definitely pre-empt that by Googling/Facebook-ing/searching yourself on all forms of social media to see what turns up. Make sure your privacy settings are restricted so your online profile shows only the image you are trying to project.
+
+If you have some space on your resume, it is good to list additional interests outside of coding. Eg. skiing, water sports, soccer, etc etc. Gives the interviewer something to talk to you about. It also shows that you are a well-rounded individual/cool person to hang out with.
+
+###### References
+
+- [Screening your resume is like playing word search](https://medium.com/@christinang89/screening-your-resume-is-like-playing-word-search-60f4d0e60840)
+- [10 tips to get past resume screening for College Students/Grads](https://christinang89.quora.com/10-tips-to-get-past-resume-screening-for-College-Students-Grads)

From ce997f725e10665a3988330682383ab0abf50340 Mon Sep 17 00:00:00 2001
From: Tay Yang Shun <tay.yang.shun@gmail.com>
Date: Thu, 5 Oct 2017 14:11:01 +0800
Subject: [PATCH 10/71] Add Resume section links to README

---
 README.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/README.md b/README.md
index 97982d0b..fdb45cf1 100644
--- a/README.md
+++ b/README.md
@@ -21,6 +21,7 @@ Carefully curated content to help you ace your next technical interview, with a
 - [Interview formats](non-technical/interview-formats.md) of the top tech companies
 - [Behavioral questions](non-technical/behavioral.md) categorized by companies
 - [Good questions to ask your interviewers](non-technical/questions-to-ask.md) at the end of the interviews
+- [Helpful resume tips](non-technical/resume.md) to get your resume noticed and the Dos and Don'ts
 
 This handbook is pretty new and help from you in contributing content would be very much appreciated!
 
@@ -46,6 +47,7 @@ Also, existing resources focus mainly on algorithm questions, and lack in covera
 - **[Front-end Study Notes](front-end)** - Summarized notes on the various aspects of front-end
   - [Front-end Job Interview Questions and Answers](front-end/interview-questions.md) 🔥⭐
 - **[Non-Technical Tips](non-technical)** - Random non-technical tips that cover behavioral and psychological aspects, interview formats and "Do you have any questions for me?"
+  - [Resume Tips](non-technical/resume.md)
   - [Behavioral Questions](non-technical/behavioral.md)
   - [Interview Formats](non-technical/interview-formats.md)
   - [Psychological Tricks](non-technical/psychological-tricks.md)

From 37cb4219173ba522cd73e2ba1c0361aa9e822582 Mon Sep 17 00:00:00 2001
From: Vishal Koosuri <vishal.koosuri1@marist.edu>
Date: Thu, 5 Oct 2017 11:01:22 -0400
Subject: [PATCH 11/71] Fix mistakes in resume section (#34)

Fix mistakes in resume section
---
 non-technical/resume.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/non-technical/resume.md b/non-technical/resume.md
index 0db3c51b..2a29011a 100644
--- a/non-technical/resume.md
+++ b/non-technical/resume.md
@@ -16,7 +16,7 @@ Before writing your resume, it is important to understand the recruiting structu
 
 ### The Skill Set Checklist
 
-Before opening up a position/starting the search for candidates, I usually consult very closely with the team manager/decision maker to find out the specific skill sets that are relevant for the position. These skill sets are typically grouped into "Must have", "Good to have", "Special bonus".
+Before opening up a position/starting the search for candidates, I usually consult very closely with the team manager/decision maker to find out the specific skill sets that are relevant for the position. These skill sets are typically grouped into "Must have", "Good to have", and "Special bonus".
 
 - "Must have" — Typically, most of the must-haves include a degree (or not) in a relevant technical field, some years (or not) of experience in a particular programming language or technology.
 - "Good to have" — Includes experience/familiarity with secondary languages/technologies which may not be directly relevant to what the candidate would be working on, but could be required due to some interfacing with other components of the project. It could also include softer skills such as being a good team player, clear communication, etc.
@@ -30,7 +30,7 @@ Typically, I do not seek that "one perfect candidate". What I seek for is the "b
 
 When I am looking at your resume, I am doing a keyword match against the skill set checklist. If I see a good amount of the right keywords in your resume, it is a pass. If I need to spend more than 10 seconds trying to figure out what you are writing about, it is a fail. If I see an excessive amount of keywords (much looking like spam), it signals a red flag and goes into the "maybe". Depending on whether I think I have enough candidates for the day, you could eventually go into the pass or fail stack.
 
-There are lots of articles writing about how recruiters only spend an average of about 10 seconds to screen each resume. The news is, this is true because resume screening such a menial, robotic and repetitive task. In fact, many applicant tracking systems (ATS) now are so advanced that they can parse your resume automatically, search for specific keywords in your resume, and score your resume based on the weights pre-assigned to each keyword.
+There are lots of articles writing about how recruiters only spend an average of about 10 seconds to screen each resume. The news is, this is true because resume screening is such a menial, robotic and repetitive task. In fact, many applicant tracking systems (ATS) now are so advanced that they can parse your resume automatically, search for specific keywords in your resume, and score your resume based on the weights pre-assigned to each keyword.
 
 Finding a job is a two-way fit — the company wants someone with the relevant skills required, but it is also important for the applicant to fit in the company culture, and be able to gain something out of his stint. Hence, honesty is the single most important criteria in a resume.
 
@@ -112,7 +112,7 @@ Always list your resume in reverse chronological order - the most recent at the
 - Be consistent about the way you format your resume. Italics, underline, bold, and how they are used.
 - Keep to a single standard font (avoid fancy fonts like Comic Sans or whatever) and do not have too many varying styles/font sizes/color
 - Be consistent about the way you list your dates (eg. May 2011 - Aug 2011). Avoid using numerals for both month and date due to the difference in style for MMDD and DDMM in different countries. Dates like "Aug 2011 - June 12" just show that you have zero attention to detail.
-- Unless you are applying for a design job, just stick to the standard "table" style for the resume. There is nothing wrong with the standard style, and it helps the recruiter screen your resume more efficiently since they asre trained through experience to read that format. It would also help in the automatic scoring by the ATS. The last thing you want is for your application to be rejected because the system could not parse your resume for it to be scored. That said, I am not discouraging you from coming up with your own design. It is nice to read something different. Just be aware of the risks you could be taking.
+- Unless you are applying for a design job, just stick to the standard "table" style for the resume. There is nothing wrong with the standard style, and it helps the recruiter screen your resume more efficiently since they are trained through experience to read that format. It would also help in the automatic scoring by the ATS. The last thing you want is for your application to be rejected because the system could not parse your resume for it to be scored. That said, I am not discouraging you from coming up with your own design. It is nice to read something different. Just be aware of the risks you could be taking.
 - Name your file `firstname_lastname_resume.pdf` instead of `resume.pdf - it is easier for recruiters to search/forward.
 - PDF preferred over Word doc.
 - Be consistent about bullet points.

From 60f9310dacc29bac66e580bb3bf3447cd4684fdd Mon Sep 17 00:00:00 2001
From: Anton <nantog@gmail.com>
Date: Fri, 6 Oct 2017 11:14:09 +0300
Subject: [PATCH 12/71] Add new questions to questions-to-ask.md (#35)

---
 non-technical/questions-to-ask.md | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/non-technical/questions-to-ask.md b/non-technical/questions-to-ask.md
index f81e913b..7e2e9d54 100644
--- a/non-technical/questions-to-ask.md
+++ b/non-technical/questions-to-ask.md
@@ -19,6 +19,14 @@ Here are some good questions to ask at the end of the interview, extracted from
 - What was something you wish someone would have told you before you joined?
 - What was your best moment so far at the company?
 
+### Product
+
+- Tell me about main products of your company.
+- What is the current version of product? (If it's v1.0 or similar - there could be a lot of chaos to work with)
+- What products are main competitors for yours?
+- What makes your product competitive?
+- When are you planning to provide the next release? (If in several months, it would mean a lot of requirements specified in job description are not so highly actual, not needed right now)
+
 ### Culture
 
 - **What is the most frustrating part about working here?**
@@ -37,6 +45,7 @@ These questions are suitable for any technical role.
 - **What has been the worst technical blunder that has happened in the recent past? How did you guys deal with it? What changes were implemented afterwards to make sure it didn't happen again?**
 - **What is the most costly technical decision made early on that the company is living with now?**
 - **What is the most fulfilling/exciting/technically complex project that you've worked on here so far?**
+- **There's "C++" (or Python, Swift or any other tech) in job description. How will you estimate my proficiency in this tech in 3 month? What exactly will I have to do concerning it - write 500 lines of code, create some classes, framework, library?**
 - How do you know what to work on each day?
 - How would you describe your engineering culture?
 - How has your role changed since joining the company?
@@ -46,6 +55,7 @@ These questions are suitable for any technical role.
 - What do you measure? What are your most important product metrics?
 - What does the company do to nurture and train its employees?
 - How often have you moved teams? What made you join the team you're on right now? If you wanted to move teams, what would need to happen?
+- If you hire person, what do you have for him to study product you're working on and processes in general? Do you have specifications, requirements, documentation?
 
 ### Management
 

From 67d83545055dba4276a26a16cdb96183974bb718 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Fri, 6 Oct 2017 16:45:15 +0800
Subject: [PATCH 13/71] Cleaning up

---
 README.md                         |  4 ++--
 non-technical/questions-to-ask.md | 18 +++++++++---------
 2 files changed, 11 insertions(+), 11 deletions(-)

diff --git a/README.md b/README.md
index fdb45cf1..e3525be9 100644
--- a/README.md
+++ b/README.md
@@ -21,7 +21,7 @@ Carefully curated content to help you ace your next technical interview, with a
 - [Interview formats](non-technical/interview-formats.md) of the top tech companies
 - [Behavioral questions](non-technical/behavioral.md) categorized by companies
 - [Good questions to ask your interviewers](non-technical/questions-to-ask.md) at the end of the interviews
-- [Helpful resume tips](non-technical/resume.md) to get your resume noticed and the Dos and Don'ts
+- [Helpful resume tips](non-technical/resume.md) to get your resume noticed and the Do's and Don'ts
 
 This handbook is pretty new and help from you in contributing content would be very much appreciated!
 
@@ -53,7 +53,7 @@ Also, existing resources focus mainly on algorithm questions, and lack in covera
   - [Psychological Tricks](non-technical/psychological-tricks.md)
   - [Questions to Ask](non-technical/questions-to-ask.md)
   - [Negotiation Tips](non-technical/negotiation.md)
-- **[Utilities](utilities)** - Snippets of algorithms/code that will help in coding questions.
+- **[Utilities](utilities)** - Snippets of algorithms/code that will help in coding questions
 
 ## Contributing
 
diff --git a/non-technical/questions-to-ask.md b/non-technical/questions-to-ask.md
index 7e2e9d54..e2239d04 100644
--- a/non-technical/questions-to-ask.md
+++ b/non-technical/questions-to-ask.md
@@ -19,14 +19,6 @@ Here are some good questions to ask at the end of the interview, extracted from
 - What was something you wish someone would have told you before you joined?
 - What was your best moment so far at the company?
 
-### Product
-
-- Tell me about main products of your company.
-- What is the current version of product? (If it's v1.0 or similar - there could be a lot of chaos to work with)
-- What products are main competitors for yours?
-- What makes your product competitive?
-- When are you planning to provide the next release? (If in several months, it would mean a lot of requirements specified in job description are not so highly actual, not needed right now)
-
 ### Culture
 
 - **What is the most frustrating part about working here?**
@@ -45,7 +37,6 @@ These questions are suitable for any technical role.
 - **What has been the worst technical blunder that has happened in the recent past? How did you guys deal with it? What changes were implemented afterwards to make sure it didn't happen again?**
 - **What is the most costly technical decision made early on that the company is living with now?**
 - **What is the most fulfilling/exciting/technically complex project that you've worked on here so far?**
-- **There's "C++" (or Python, Swift or any other tech) in job description. How will you estimate my proficiency in this tech in 3 month? What exactly will I have to do concerning it - write 500 lines of code, create some classes, framework, library?**
 - How do you know what to work on each day?
 - How would you describe your engineering culture?
 - How has your role changed since joining the company?
@@ -56,6 +47,15 @@ These questions are suitable for any technical role.
 - What does the company do to nurture and train its employees?
 - How often have you moved teams? What made you join the team you're on right now? If you wanted to move teams, what would need to happen?
 - If you hire person, what do you have for him to study product you're working on and processes in general? Do you have specifications, requirements, documentation?
+- There's "C++" (or Python, Swift or any other tech) in the job description. How will you estimate my proficiency in this tech in 3 months?
+
+### Product
+
+- Tell me about the main products of your company.
+- What is the current version of product? (If it is v1.0 or similar - there could be a lot of chaos to work with)
+- What products are your main competitors?
+- What makes your product competitive?
+- When are you planning to provide the next release? (If in several months, it would mean a lot of requirements specified in job description are not needed right now)
 
 ### Management
 

From 5f5f0cde517380c8ef666a5df1a538acf7b27827 Mon Sep 17 00:00:00 2001
From: Jorge Gonzalez <jorgegonzalez@users.noreply.github.com>
Date: Mon, 9 Oct 2017 04:02:57 -0400
Subject: [PATCH 14/71] Remove duplicate problem in Linked Lists (#36)

---
 algorithms/linked-list.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/algorithms/linked-list.md b/algorithms/linked-list.md
index 67cda73f..8dd1dbdd 100644
--- a/algorithms/linked-list.md
+++ b/algorithms/linked-list.md
@@ -10,4 +10,3 @@ Linked List
 - A question involving an API's integration with hash map where the buckets of hash map are made up of linked lists.
 - Given a singly linked list (a list which can only be traversed in one direction), find the item that is located at 'k' items from the end. So if the list is a, b, c, d and k is 2 then the answer is 'c'. The solution should not search the list twice.
 - How can you tell if a Linked List is a Palindrome?
-- Implement a LRU cache with O(1) runtime for all its operations.

From 0516f5e9742dedbce56182cbd71360e8905e105c Mon Sep 17 00:00:00 2001
From: Jorge Gonzalez <jorgegonzalez@users.noreply.github.com>
Date: Mon, 9 Oct 2017 13:44:08 -0400
Subject: [PATCH 15/71] Add lonely number problem (#37)

---
 algorithms/array.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/algorithms/array.md b/algorithms/array.md
index feadbedd..336db8ca 100644
--- a/algorithms/array.md
+++ b/algorithms/array.md
@@ -56,3 +56,5 @@ Arrays
 - Given an array, return the length of the longest increasing contiguous subarray.
   - E.g., `[1, 3, 2, 3, 4, 8, 7, 9]`, should return `4` because the longest increasing array is `[2, 3, 4, 8]`.
   - [Source](http://blog.gainlo.co/index.php/2017/02/02/uber-interview-questions-longest-increasing-subarray/).
+- Given an array of integers where every value appears twice except one, find the single, non-repeating value. Do so with a running time of O(1).
+  - E.g., `[2, 5, 3, 2, 1, 3, 4, 5, 1]` returns 4, because it is the only value that appears in the array only once.

From ca10d557d30c0aea796e798e93afb8c752f152bd Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Tue, 10 Oct 2017 01:48:27 +0800
Subject: [PATCH 16/71] Fix lonely number problem

---
 algorithms/array.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/algorithms/array.md b/algorithms/array.md
index 336db8ca..016e3fbc 100644
--- a/algorithms/array.md
+++ b/algorithms/array.md
@@ -56,5 +56,5 @@ Arrays
 - Given an array, return the length of the longest increasing contiguous subarray.
   - E.g., `[1, 3, 2, 3, 4, 8, 7, 9]`, should return `4` because the longest increasing array is `[2, 3, 4, 8]`.
   - [Source](http://blog.gainlo.co/index.php/2017/02/02/uber-interview-questions-longest-increasing-subarray/).
-- Given an array of integers where every value appears twice except one, find the single, non-repeating value. Do so with a running time of O(1).
+- Given an array of integers where every value appears twice except one, find the single, non-repeating value. Follow up: do so with O(1) space.
   - E.g., `[2, 5, 3, 2, 1, 3, 4, 5, 1]` returns 4, because it is the only value that appears in the array only once.

From 05fbf436dcdbe9a25c17cc32d757fd7992c517d4 Mon Sep 17 00:00:00 2001
From: Jorge Gonzalez <jorgegonzalez@users.noreply.github.com>
Date: Mon, 9 Oct 2017 22:48:24 -0400
Subject: [PATCH 17/71] Create mergeSort.js (#38)

---
 utilities/javascript/mergeSort.js | 54 +++++++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 utilities/javascript/mergeSort.js

diff --git a/utilities/javascript/mergeSort.js b/utilities/javascript/mergeSort.js
new file mode 100644
index 00000000..b5640444
--- /dev/null
+++ b/utilities/javascript/mergeSort.js
@@ -0,0 +1,54 @@
+function mergeSort(arr) {
+  if (arr.length < 2) {
+    // Arrays of length 0 or 1 are sorted by definition
+    return arr;
+  }
+
+  const left = arr.slice(0, Math.floor(arr.length / 2));
+  const right = arr.slice(Math.floor(arr.length / 2), Math.floor(arr.length));
+
+  return merge(mergeSort(left), mergeSort(right));
+}
+
+function merge(arr1, arr2) {
+  const merged = [];
+
+  let i = 0;
+  let j = 0;
+
+  while (i < arr1.length && j < arr2.length) {
+    if (arr1[i] < arr2[j]) {
+      merged.push(arr1[i]);
+      i++;
+    } else if (arr2[j] < arr1[i]) {
+      merged.push(arr2[j]);
+      j++;
+    } else {
+      merged.push(arr1[i]);
+      i++;
+      j++;
+    }
+  }
+
+  while (i < arr1.length) {
+    merged.push(arr1[i]);
+    i++;
+  }
+
+  while (j < arr2.length) {
+    merged.push(arr2[j]);
+    j++;
+  }
+
+  return merged;
+}
+
+const arr1 = [7, 2, 4, 3, 1, 2];
+const arr2 = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1];
+const arr3 = [98322, 3242, 876, -234, 34, 12331];
+const arr4 = [1, 2, 3, 4, 5, 0];
+
+console.log(mergeSort(arr1));
+console.log(mergeSort(arr2));
+console.log(mergeSort(arr3));
+console.log(mergeSort(arr4));

From e0a0fd549e147e0c73da308a80980264115e0ce1 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Tue, 10 Oct 2017 11:06:13 +0800
Subject: [PATCH 18/71] Refine tests for mergeSort

---
 utilities/javascript/deepEqual.js | 38 +++++++++++++
 utilities/javascript/mergeSort.js | 94 +++++++++++++++++--------------
 2 files changed, 90 insertions(+), 42 deletions(-)
 create mode 100644 utilities/javascript/deepEqual.js

diff --git a/utilities/javascript/deepEqual.js b/utilities/javascript/deepEqual.js
new file mode 100644
index 00000000..78eeb285
--- /dev/null
+++ b/utilities/javascript/deepEqual.js
@@ -0,0 +1,38 @@
+function deepEqual(val1, val2) {
+    if (typeof val1 !== typeof val2) {
+        return false;
+    }
+
+    // Array comparison.
+    if (Array.isArray(val1) && Array.isArray(val2)) {
+        if (val1.length !== val2.length) {
+            return false;
+        }
+        for (let i = 0; i < val1.length; i++) {
+            if (!deepEqual(val1[i], val2[i])) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    // Object comparison.
+    if (typeof val1 === 'object' && typeof val2 === 'object') {
+        const keys1 = Object.keys(val1);
+        const keys2 = Object.keys(val2);
+        if (keys1.length !== keys2.length) {
+            return false;
+        }
+        for (let i = 0; i < keys1.length; i++) {
+            if (!deepEqual(val1[keys1[i]], val2[keys2[i]])) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    // Primitive comparison.
+    return val1 === val2;
+}
+
+module.exports = deepEqual;
diff --git a/utilities/javascript/mergeSort.js b/utilities/javascript/mergeSort.js
index b5640444..b6ef23fe 100644
--- a/utilities/javascript/mergeSort.js
+++ b/utilities/javascript/mergeSort.js
@@ -1,54 +1,64 @@
 function mergeSort(arr) {
-  if (arr.length < 2) {
-    // Arrays of length 0 or 1 are sorted by definition
-    return arr;
-  }
+    if (arr.length < 2) {
+        // Arrays of length 0 or 1 are sorted by definition.
+        return arr;
+    }
 
-  const left = arr.slice(0, Math.floor(arr.length / 2));
-  const right = arr.slice(Math.floor(arr.length / 2), Math.floor(arr.length));
+    const left = arr.slice(0, Math.floor(arr.length / 2));
+    const right = arr.slice(Math.floor(arr.length / 2), Math.floor(arr.length));
 
-  return merge(mergeSort(left), mergeSort(right));
+    return merge(mergeSort(left), mergeSort(right));
 }
 
 function merge(arr1, arr2) {
-  const merged = [];
-
-  let i = 0;
-  let j = 0;
+    const merged = [];
+    let i = 0, j = 0;
 
-  while (i < arr1.length && j < arr2.length) {
-    if (arr1[i] < arr2[j]) {
-      merged.push(arr1[i]);
-      i++;
-    } else if (arr2[j] < arr1[i]) {
-      merged.push(arr2[j]);
-      j++;
-    } else {
-      merged.push(arr1[i]);
-      i++;
-      j++;
+    while (i < arr1.length && j < arr2.length) {
+        if (arr1[i] <= arr2[j]) {
+            merged.push(arr1[i]);
+            i++;
+        } else if (arr2[j] < arr1[i]) {
+            merged.push(arr2[j]);
+            j++;
+        }
     }
-  }
-
-  while (i < arr1.length) {
-    merged.push(arr1[i]);
-    i++;
-  }
-
-  while (j < arr2.length) {
-    merged.push(arr2[j]);
-    j++;
-  }
 
-  return merged;
+    merged.push(...arr1.slice(i), ...arr2.slice(j));
+    return merged;
 }
 
-const arr1 = [7, 2, 4, 3, 1, 2];
-const arr2 = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1];
-const arr3 = [98322, 3242, 876, -234, 34, 12331];
-const arr4 = [1, 2, 3, 4, 5, 0];
+const deepEqual = require('./deepEqual');
 
-console.log(mergeSort(arr1));
-console.log(mergeSort(arr2));
-console.log(mergeSort(arr3));
-console.log(mergeSort(arr4));
+console.log(deepEqual(
+    mergeSort([]),
+    [],
+));
+console.log(deepEqual(
+    mergeSort([1]),
+    [1],
+));
+console.log(deepEqual(
+    mergeSort([2, 1]),
+    [1, 2],
+));
+console.log(deepEqual(
+    mergeSort([7, 2, 4, 3, 1, 2]),
+    [1, 2, 2, 3, 4, 7],
+));
+console.log(deepEqual(
+    mergeSort([7, 2, 4, 3, 1, 2]),
+    [1, 2, 2, 3, 4, 7],
+));
+console.log(deepEqual(
+    mergeSort([10, 9, 8, 7, 6, 5, 4, 3, 2, 1]),
+    [1, 2, 3, 4, 5, 6, 7, 8, 9, 10],
+));
+console.log(deepEqual(
+    mergeSort([98322, 3242, 876, -234, 34, 12331]),
+    [-234, 34, 876, 3242, 12331, 98322],
+));
+console.log(deepEqual(
+    mergeSort([1, 2, 3, 4, 5, 0]),
+    [0, 1, 2, 3, 4, 5],
+));

From 35cf3c1b05111750b751f02eaa8906a69fdc3b39 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Tue, 10 Oct 2017 23:14:11 +0800
Subject: [PATCH 19/71] Add Lago

---
 algorithms/README.md | 2 ++
 preparing/README.md  | 2 ++
 2 files changed, 4 insertions(+)

diff --git a/algorithms/README.md b/algorithms/README.md
index 0ad01b24..c9049a49 100644
--- a/algorithms/README.md
+++ b/algorithms/README.md
@@ -5,6 +5,8 @@ This section dives deep into practical tips for specific topics of algorithms an
 
 For each topic, study links are recommended to help you master the topic. There is a list of recommended common questions to practice which in my opinion is highly valuable for mastering the core concepts for the topic.
 
+If you are interested in how data structures are implemented, check out [Lago](https://github.com/yangshun/lago), an Data Structures and Algorithms library for JavaScript. It is pretty much still WIP but I intend to make it into a library that is able to be used in production and also a reference resource for learning Data Structures and Algorithms.
+
 ## Contents
 
 - [Array](array.md)
diff --git a/preparing/README.md b/preparing/README.md
index 73a47e03..af5ce90c 100644
--- a/preparing/README.md
+++ b/preparing/README.md
@@ -21,6 +21,8 @@ This [interviews repository](https://github.com/kdn251/interviews) by Kevin Naug
 
 The Medium publication [basecs](https://medium.com/basecs) by [Vaidehi Joshi](https://medium.com/@vaidehijoshi) is also a great and light-hearted resource to recap on the various data structures and algorithms.
 
+If you are interested in how data structures are implemented, check out [Lago](https://github.com/yangshun/lago), an Data Structures and Algorithms library for JavaScript. It is pretty much still WIP but I intend to make it into a library that is able to be used in production and also a reference resource for learning Data Structures and Algorithms.
+
 ### Mastery through Practice
 
 Next, gain familiarity and mastery of the algorithms and data structures in your chosen programming language:

From 50df8650c9ab46088d32268f068a0af564a67929 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Tue, 10 Oct 2017 23:19:04 +0800
Subject: [PATCH 20/71] Fix mention of Lago

---
 README.md            | 4 ++++
 algorithms/README.md | 2 +-
 preparing/README.md  | 2 +-
 3 files changed, 6 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index e3525be9..0b126c6a 100644
--- a/README.md
+++ b/README.md
@@ -55,6 +55,10 @@ Also, existing resources focus mainly on algorithm questions, and lack in covera
   - [Negotiation Tips](non-technical/negotiation.md)
 - **[Utilities](utilities)** - Snippets of algorithms/code that will help in coding questions
 
+## Related
+
+If you are interested in how data structures are implemented, check out [Lago](https://github.com/yangshun/lago), a Data Structures and Algorithms library for JavaScript. It is pretty much still WIP but I intend to make it into a library that is able to be used in production and also a reference resource for revising Data Structures and Algorithms.
+
 ## Contributing
 
 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.
diff --git a/algorithms/README.md b/algorithms/README.md
index c9049a49..ef59cf33 100644
--- a/algorithms/README.md
+++ b/algorithms/README.md
@@ -5,7 +5,7 @@ This section dives deep into practical tips for specific topics of algorithms an
 
 For each topic, study links are recommended to help you master the topic. There is a list of recommended common questions to practice which in my opinion is highly valuable for mastering the core concepts for the topic.
 
-If you are interested in how data structures are implemented, check out [Lago](https://github.com/yangshun/lago), an Data Structures and Algorithms library for JavaScript. It is pretty much still WIP but I intend to make it into a library that is able to be used in production and also a reference resource for learning Data Structures and Algorithms.
+If you are interested in how data structures are implemented, check out [Lago](https://github.com/yangshun/lago), a Data Structures and Algorithms library for JavaScript. It is pretty much still WIP but I intend to make it into a library that is able to be used in production and also a reference resource for revising Data Structures and Algorithms.
 
 ## Contents
 
diff --git a/preparing/README.md b/preparing/README.md
index af5ce90c..1ee58cfc 100644
--- a/preparing/README.md
+++ b/preparing/README.md
@@ -21,7 +21,7 @@ This [interviews repository](https://github.com/kdn251/interviews) by Kevin Naug
 
 The Medium publication [basecs](https://medium.com/basecs) by [Vaidehi Joshi](https://medium.com/@vaidehijoshi) is also a great and light-hearted resource to recap on the various data structures and algorithms.
 
-If you are interested in how data structures are implemented, check out [Lago](https://github.com/yangshun/lago), an Data Structures and Algorithms library for JavaScript. It is pretty much still WIP but I intend to make it into a library that is able to be used in production and also a reference resource for learning Data Structures and Algorithms.
+If you are interested in how data structures are implemented, check out [Lago](https://github.com/yangshun/lago), a Data Structures and Algorithms library for JavaScript. It is pretty much still WIP but I intend to make it into a library that is able to be used in production and also a reference resource for revising Data Structures and Algorithms.
 
 ### Mastery through Practice
 

From 4038c4fbf4de2689e2620aa3c68777ab45cd0973 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Wed, 11 Oct 2017 00:38:57 +0800
Subject: [PATCH 21/71] Fix mergeSort tests

---
 utilities/javascript/mergeSort.js | 8 ++------
 1 file changed, 2 insertions(+), 6 deletions(-)

diff --git a/utilities/javascript/mergeSort.js b/utilities/javascript/mergeSort.js
index b6ef23fe..d66537fd 100644
--- a/utilities/javascript/mergeSort.js
+++ b/utilities/javascript/mergeSort.js
@@ -47,8 +47,8 @@ console.log(deepEqual(
     [1, 2, 2, 3, 4, 7],
 ));
 console.log(deepEqual(
-    mergeSort([7, 2, 4, 3, 1, 2]),
-    [1, 2, 2, 3, 4, 7],
+    mergeSort([1, 2, 3, 4, 5, 0]),
+    [0, 1, 2, 3, 4, 5],
 ));
 console.log(deepEqual(
     mergeSort([10, 9, 8, 7, 6, 5, 4, 3, 2, 1]),
@@ -58,7 +58,3 @@ console.log(deepEqual(
     mergeSort([98322, 3242, 876, -234, 34, 12331]),
     [-234, 34, 876, 3242, 12331, 98322],
 ));
-console.log(deepEqual(
-    mergeSort([1, 2, 3, 4, 5, 0]),
-    [0, 1, 2, 3, 4, 5],
-));

From 3691478bb318a6735fd48e1bf5334a20b44e607e Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Wed, 11 Oct 2017 00:39:07 +0800
Subject: [PATCH 22/71] Mention Lago

---
 README.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/README.md b/README.md
index 0b126c6a..002d416d 100644
--- a/README.md
+++ b/README.md
@@ -54,6 +54,7 @@ Also, existing resources focus mainly on algorithm questions, and lack in covera
   - [Questions to Ask](non-technical/questions-to-ask.md)
   - [Negotiation Tips](non-technical/negotiation.md)
 - **[Utilities](utilities)** - Snippets of algorithms/code that will help in coding questions
+  - **UPDATE** - Check out [Lago](https://github.com/yangshun/lago), which is a Data Structures and Algorithms library that contains more high quality implementations with 100% test coverage.
 
 ## Related
 

From 149ae240907d9bc2d39b77cba04027e7873c4c37 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Wed, 11 Oct 2017 01:36:39 +0800
Subject: [PATCH 23/71] Remove empty scripts

---
 utilities/python/graph_dijkstra.py    | 1 -
 utilities/python/string_rabin_karp.py | 1 -
 2 files changed, 2 deletions(-)
 delete mode 100644 utilities/python/graph_dijkstra.py
 delete mode 100644 utilities/python/string_rabin_karp.py

diff --git a/utilities/python/graph_dijkstra.py b/utilities/python/graph_dijkstra.py
deleted file mode 100644
index 46409041..00000000
--- a/utilities/python/graph_dijkstra.py
+++ /dev/null
@@ -1 +0,0 @@
-# TODO
diff --git a/utilities/python/string_rabin_karp.py b/utilities/python/string_rabin_karp.py
deleted file mode 100644
index 46409041..00000000
--- a/utilities/python/string_rabin_karp.py
+++ /dev/null
@@ -1 +0,0 @@
-# TODO

From c4fd83ed9cad1e7640be1b112dbe203673db5b8e Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Thu, 12 Oct 2017 14:36:38 +0800
Subject: [PATCH 24/71] Add more behavioral questions

---
 non-technical/behavioral.md | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/non-technical/behavioral.md b/non-technical/behavioral.md
index decf0fb2..ce84afe0 100644
--- a/non-technical/behavioral.md
+++ b/non-technical/behavioral.md
@@ -12,6 +12,7 @@ Learn the [STAR](https://en.wikipedia.org/wiki/Situation,_task,_action,_result)
 
 - Why do you want to work for X company?
 - Why do you want to leave your current/last company?
+- What are you looking for in your next role?
 - Tell me about a time where you had a conflict with a co-worker.
 - Tell me about a time in which you had a conflict and needed to influence somebody else.
 - What project are you currently working on?
@@ -19,11 +20,15 @@ Learn the [STAR](https://en.wikipedia.org/wiki/Situation,_task,_action,_result)
 - What was the most difficult bug that you fixed in the past 6 months?
 - How do you tackle challenges? Name a difficult challenge you faced while working on a project, how you overcame it, and what you learned.
 - What are you excited about?
+- What frustrates you?
 - Imagine it is your first day here at the company. What do you want to work on? What features would you improve on?
 - What are the most interesting projects you have worked on and how might they be relevant to this company's environment?
 - Tell me about a time you had a disagreement with your manager.
 - Talk about a project you are most passionate about, or one where you did your best work.
 - What does your best day of work look like?
+- What is something that you had to push for in your previous projects?
+- What is the most constructive feedback you have received in your career?
+- What was one thing you had to persevere for multiple months?
 
 ## Airbnb
 
@@ -35,6 +40,7 @@ While loving to travel or appreciating Airbnb's growth may be good answers, try
 - What large problems in the world would you solve today?
 - Why do you like Airbnb?
 - If you had an unlimited budget and you could buy one gift for one person, what would you buy and who would you buy it for?
+- If you had an unlimited budget and you could go somewhere, where would you go?
 - Share one of your trips with us.
 - What is the most challenging project in or out of school that you have worked on in the last 6 months.
 - What is the thing that you don't want from your last internship/job?

From dd061c0ab1c2889a8eb12c7b3c1f94e367393c20 Mon Sep 17 00:00:00 2001
From: d-pfeif <32519965+d-pfeif@users.noreply.github.com>
Date: Thu, 12 Oct 2017 15:20:46 -0600
Subject: [PATCH 25/71] added missing back tic and added resume layout (#42)

---
 non-technical/resume.md | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/non-technical/resume.md b/non-technical/resume.md
index 2a29011a..b77fe359 100644
--- a/non-technical/resume.md
+++ b/non-technical/resume.md
@@ -113,7 +113,7 @@ Always list your resume in reverse chronological order - the most recent at the
 - Keep to a single standard font (avoid fancy fonts like Comic Sans or whatever) and do not have too many varying styles/font sizes/color
 - Be consistent about the way you list your dates (eg. May 2011 - Aug 2011). Avoid using numerals for both month and date due to the difference in style for MMDD and DDMM in different countries. Dates like "Aug 2011 - June 12" just show that you have zero attention to detail.
 - Unless you are applying for a design job, just stick to the standard "table" style for the resume. There is nothing wrong with the standard style, and it helps the recruiter screen your resume more efficiently since they are trained through experience to read that format. It would also help in the automatic scoring by the ATS. The last thing you want is for your application to be rejected because the system could not parse your resume for it to be scored. That said, I am not discouraging you from coming up with your own design. It is nice to read something different. Just be aware of the risks you could be taking.
-- Name your file `firstname_lastname_resume.pdf` instead of `resume.pdf - it is easier for recruiters to search/forward.
+- Name your file `firstname_lastname_resume.pdf` instead of `resume.pdf` - it is easier for recruiters to search/forward.
 - PDF preferred over Word doc.
 - Be consistent about bullet points.
 - Your resume should not look sparse. (Come on, it is only 1 page!) If you really have trouble filling it up, you are either not thinking hard enough, or not doing enough. In the case of the latter, consider working on your personal projects (i.e. stuff you can post on GitHub). That said, do not write stuff just to fill space. Read point 4.
@@ -138,6 +138,14 @@ Here's the news - Recruiters do search for your name! Definitely pre-empt that b
 
 If you have some space on your resume, it is good to list additional interests outside of coding. Eg. skiing, water sports, soccer, etc etc. Gives the interviewer something to talk to you about. It also shows that you are a well-rounded individual/cool person to hang out with.
 
+#### 11. Resume Layout
+
+Absolutely, no headshots.
+
+It's important to note the layout of your resume. If you choose to quickly upload your resume via an auto-fill program, understand that the program will read your resume from top to bottom, left to right. This is good to keep in mind when developing the layout of your resume.
+
+Try to keep white space down to a minimum. This will also help reduce the length of your resume to one page. For instance, white space usually exists near the sides of your resume. Use that space to list out your skills in a vertical column!
+
 ###### References
 
 - [Screening your resume is like playing word search](https://medium.com/@christinang89/screening-your-resume-is-like-playing-word-search-60f4d0e60840)

From b46a7b14910bab088054911adbff02100b48165b Mon Sep 17 00:00:00 2001
From: Fabricio20 <Fabricio20@users.noreply.github.com>
Date: Sat, 14 Oct 2017 02:08:21 +0900
Subject: [PATCH 26/71] Fix typos in Front End interview questions (#43)

---
 front-end/interview-questions.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index d1bc3a0b..70031168 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -324,7 +324,7 @@ These techniques are related to accessibility (a11y).
 
 - `visibility: hidden`. However the element is still in the flow of the page, and still takes up space.
 - `width: 0; height: 0`. Make the element not take up any space on the screen at all, resulting in not showing it.
-- `position; absolute; left: -99999px`. Position it outside of the screen.
+- `position: absolute; left: -99999px`. Position it outside of the screen.
 - `text-indent: -9999px`. This only works on text within the `block` elements.
 
 I would go with the `absolute` positioning approach, as it has the least caveats and works for most elements.
@@ -528,7 +528,7 @@ I would write CSS rules with low specificity so that they can be easily overridd
 ### What existing CSS frameworks have you used locally, or in production? How would you change/improve them?
 
 - **Bootstrap** - Slow release cycle. Bootstrap 4 has been in alpha for almost 2 years. Add a spinner button component, as it is widely-used.
-- **Semantic UI** - Source code structure makes theme customization is extremely hard to understand. Painful to customize with unconventional theming system. Hardcoded config path within the vendor library. Not well-designed for overriding variables unlike in Bootstrap.
+- **Semantic UI** - Source code structure makes theme customization extremely hard to understand. Painful to customize with unconventional theming system. Hardcoded config path within the vendor library. Not well-designed for overriding variables unlike in Bootstrap.
 - **Bulma** - A lot of non-semantic and superfluous classes and markup required. Not backward compatible. Upgrading versions breaks the app in subtle manners.
 
 ### Have you played around with the new CSS Flexbox or Grid specs?
@@ -1202,7 +1202,7 @@ Practically, ES2015 has vastly improved JavaScript and made it much nicer to wri
 
 - https://softwareengineering.stackexchange.com/questions/72569/what-are-the-pros-and-cons-of-coffeescript
 
-### What tools and techniques do you use debugging JavaScript code?
+### What tools and techniques do you use for debugging JavaScript code?
 
 - React and Redux
   - [React Devtools](https://github.com/facebook/react-devtools)

From 177f7909f252d7d8d90665ce865aa61020c508a7 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 14:31:19 +0800
Subject: [PATCH 27/71] Add in interview cheatsheet

---
 README.md               |  2 +
 preparing/cheatsheet.md | 95 +++++++++++++++++++++++++++++++++++++++++
 2 files changed, 97 insertions(+)
 create mode 100644 preparing/cheatsheet.md

diff --git a/README.md b/README.md
index 002d416d..1cc0b701 100644
--- a/README.md
+++ b/README.md
@@ -16,6 +16,7 @@
 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](preparing) for coding interviews
+- [Interview Cheatsheet](preparing/cheatsheet.md) - Straight-to-the-point Do's and Don'ts
 - [Algorithm tips and the best practice questions](algorithms) categorized by topic
 - ["Front-end Job Interview Questions" answers](front-end/interview-questions.md)
 - [Interview formats](non-technical/interview-formats.md) of the top tech companies
@@ -42,6 +43,7 @@ Also, existing resources focus mainly on algorithm questions, and lack in covera
 ## Contents
 
 - **[Preparing for a Coding Interview](preparing)**
+  - [Interview cheatsheet](preparing/cheatsheet.md) - Straight-to-the-point Do's and Don'ts
 - **[Algorithm Questions](algorithms)** - Questions categorized by topics
 - **[Design Questions](design)**
 - **[Front-end Study Notes](front-end)** - Summarized notes on the various aspects of front-end
diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
new file mode 100644
index 00000000..9e4e163e
--- /dev/null
+++ b/preparing/cheatsheet.md
@@ -0,0 +1,95 @@
+Interview Cheatsheet
+==
+
+This is a straight-to-the-point distilled list of technical interview Do's and Don'ts. Some of these may apply to only phone screens on whiteboard interviews but most will apply to both.
+
+### 1. Before Interview
+
+**Do's**
+
+- Prepare pen, paper and earphones/headphones.
+- Find a quiet environment with good internet connection.
+- Stay calm and composed.
+- Familiarize yourself with the coding environment - CoderPad, CodePen, etc.
+- Dress comfortably. Usually you do not need to wear shirt and tie.
+
+### 2. Introduction
+
+**Do's**
+
+- Introduce yourself in a few sentences under a minute.
+- Mention interesting points that are relevant to the role you are applying for.
+- Sound enthusiastic! Speak with a smile and you will naturally sound more engaging.
+
+**Don'ts**
+
+- Spend too long introducing yourself. The more time you spend talk the less time you have to code.
+
+### 3. Upon Getting the Question
+
+**Do's**
+
+- Repeat the question back at the interviewer.
+- Clarify input format and range.
+- Work through a small example to ensure you understood the question.
+- Explain a high level approach even if it is a brute force one.
+- Improve upon the approach and optimize.
+- State and explain the time and space complexity of your approaches.
+- If stuck, think about related problems you've seen before and how they were solved. Check out the [tips](../algorithms) in this section.
+
+**Don'ts**
+
+- Ignore information given to you. Every piece is important.
+- Jump into coding straightaway.
+- Start coding without interviewer's green light.
+
+### 4. During Coding
+
+**Do's**
+
+- Practice good coding style. Clear variable names, consistent operator spacing.
+- Defensive coding. Check for nulls, empty collections, etc.
+- Explain what you are coding/typing to the interviewer, what you are trying to achieve.
+- Type/write at a reasonable speed.
+- Write in a modular fashion. Extract out chunks of repeated code into functions.
+- Use the hints given by the interviewer.
+- Practice whiteboard space-management skills.
+- Demonstrate mastery of the language.
+- Let the interviewer talk. Usually if they speak, they are trying to give you hints or steer you in the right direction.
+
+**Don'ts**
+
+- Remain quiet the whole time.
+- Spend too much time writing comments.
+- Use extremely verbose variable names.
+- Copy and paste code without checking.
+- Write too big (takes up too much space) or too small (illegible) if on a whiteboard.
+
+### 5. After Coding
+
+**Do's**
+
+- Scan through your code for mistakes as if it was your first time seeing code written by someone else.
+- Check for off-by-one errors.
+- Come up with more test cases. Try extreme test cases.
+- Step through your code with those test cases.
+- Look out for places where you can refactor.
+- Reiterate the time and space complexity of your code.
+- Explain trade-offs and how the code/approach can be improved if given more time.
+
+**Don'ts**
+
+- Immediately announce that you are done coding.
+- Argue with the interviewer.
+
+### 6. Wrap Up
+
+**Do's**
+
+- Ask questions and ask good questions! Pick some questions from [here](../non-technical/questions-to-ask).
+- Ask questions that are tailored to the company.
+- Thank the interviewer.
+
+**Don'ts**
+
+- End the interview without asking any questions.

From 790940826ff86edf68f07daa43c077237445ed3a Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 15:26:43 +0800
Subject: [PATCH 28/71] Fix cheatsheet

---
 preparing/cheatsheet.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 9e4e163e..f89cdd5a 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -1,7 +1,7 @@
 Interview Cheatsheet
 ==
 
-This is a straight-to-the-point distilled list of technical interview Do's and Don'ts. Some of these may apply to only phone screens on whiteboard interviews but most will apply to both.
+This is a straight-to-the-point distilled list of technical interview Do's and Don'ts. Some of these may apply to only phone screens on whiteboard interviews but most will apply to both. I revise this list before each of my interviews to remind myself of them and eventually internalized all of them to the point I do not have to rely on it anymore.
 
 ### 1. Before Interview
 
@@ -86,7 +86,7 @@ This is a straight-to-the-point distilled list of technical interview Do's and D
 
 **Do's**
 
-- Ask questions and ask good questions! Pick some questions from [here](../non-technical/questions-to-ask).
+- Ask questions and ask good questions! Pick some questions from [here](../non-technical/questions-to-ask.md).
 - Ask questions that are tailored to the company.
 - Thank the interviewer.
 

From 077bc448b8ba4ecbc9d063cdf269986430d9e2fc Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 15:36:46 +0800
Subject: [PATCH 29/71] Improve cheatsheet

---
 preparing/cheatsheet.md | 23 +++++++++++++----------
 1 file changed, 13 insertions(+), 10 deletions(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index f89cdd5a..1029e492 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -3,14 +3,16 @@ Interview Cheatsheet
 
 This is a straight-to-the-point distilled list of technical interview Do's and Don'ts. Some of these may apply to only phone screens on whiteboard interviews but most will apply to both. I revise this list before each of my interviews to remind myself of them and eventually internalized all of them to the point I do not have to rely on it anymore.
 
+For a detailed walkthrough of interview preparation, refer to the ["How to Prepare"](./) section.
+
 ### 1. Before Interview
 
 **Do's**
 
 - Prepare pen, paper and earphones/headphones.
-- Find a quiet environment with good internet connection.
+- Find a quiet environment with good Internet connection.
 - Stay calm and composed.
-- Familiarize yourself with the coding environment - CoderPad, CodePen, etc.
+- Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.
 - Dress comfortably. Usually you do not need to wear shirt and tie.
 
 ### 2. Introduction
@@ -33,29 +35,29 @@ This is a straight-to-the-point distilled list of technical interview Do's and D
 - Clarify input format and range.
 - Work through a small example to ensure you understood the question.
 - Explain a high level approach even if it is a brute force one.
-- Improve upon the approach and optimize.
-- State and explain the time and space complexity of your approaches.
-- If stuck, think about related problems you've seen before and how they were solved. Check out the [tips](../algorithms) in this section.
+- Improve upon the approach and optimize. Reduce duplicated work and cache repeated computations.
+- Think carefully, then state and explain the time and space complexity of your approaches.
+- If stuck, think about related problems you have seen before and how they were solved. Check out the [tips](../algorithms) in this section.
 
 **Don'ts**
 
 - Ignore information given to you. Every piece is important.
 - Jump into coding straightaway.
 - Start coding without interviewer's green light.
+- Appear too unsure about your approach or analysis.
 
 ### 4. During Coding
 
 **Do's**
 
-- Practice good coding style. Clear variable names, consistent operator spacing.
+- Practice good coding style. Clear variable names, consistent operator spacing, proper indentation, etc.
 - Defensive coding. Check for nulls, empty collections, etc.
 - Explain what you are coding/typing to the interviewer, what you are trying to achieve.
 - Type/write at a reasonable speed.
 - Write in a modular fashion. Extract out chunks of repeated code into functions.
 - Use the hints given by the interviewer.
 - Practice whiteboard space-management skills.
-- Demonstrate mastery of the language.
-- Let the interviewer talk. Usually if they speak, they are trying to give you hints or steer you in the right direction.
+- Demonstrate mastery of your chosen programming language.
 
 **Don'ts**
 
@@ -63,6 +65,7 @@ This is a straight-to-the-point distilled list of technical interview Do's and D
 - Spend too much time writing comments.
 - Use extremely verbose variable names.
 - Copy and paste code without checking.
+- Interrupt your interviewer when they are talking. Usually if they speak, they are trying to give you hints or steer you in the right direction.
 - Write too big (takes up too much space) or too small (illegible) if on a whiteboard.
 
 ### 5. After Coding
@@ -86,10 +89,10 @@ This is a straight-to-the-point distilled list of technical interview Do's and D
 
 **Do's**
 
-- Ask questions and ask good questions! Pick some questions from [here](../non-technical/questions-to-ask.md).
-- Ask questions that are tailored to the company.
+- Ask questions. More importantly, ask good and engaging questions that are tailored to the company! Pick some questions from [here](../non-technical/questions-to-ask.md).
 - Thank the interviewer.
 
 **Don'ts**
 
 - End the interview without asking any questions.
+- Ask about interview performance. It can get awkward.

From 569d92a200b26a3d46e65883947cd47a7485ed92 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 15:45:38 +0800
Subject: [PATCH 30/71] Improve interview cheatsheet further

---
 preparing/cheatsheet.md | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 1029e492..eb46d162 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -3,7 +3,7 @@ Interview Cheatsheet
 
 This is a straight-to-the-point distilled list of technical interview Do's and Don'ts. Some of these may apply to only phone screens on whiteboard interviews but most will apply to both. I revise this list before each of my interviews to remind myself of them and eventually internalized all of them to the point I do not have to rely on it anymore.
 
-For a detailed walkthrough of interview preparation, refer to the ["How to Prepare"](./) section.
+For a detailed walkthrough of interview preparation, refer to the ["Preparing for a Coding Interview"](./) section.
 
 ### 1. Before Interview
 
@@ -19,7 +19,7 @@ For a detailed walkthrough of interview preparation, refer to the ["How to Prepa
 
 **Do's**
 
-- Introduce yourself in a few sentences under a minute.
+- Introduce yourself in a few sentences under a minute or two.
 - Mention interesting points that are relevant to the role you are applying for.
 - Sound enthusiastic! Speak with a smile and you will naturally sound more engaging.
 
@@ -89,10 +89,10 @@ For a detailed walkthrough of interview preparation, refer to the ["How to Prepa
 
 **Do's**
 
-- Ask questions. More importantly, ask good and engaging questions that are tailored to the company! Pick some questions from [here](../non-technical/questions-to-ask.md).
+- Ask questions. More importantly, ask good and engaging questions that are tailored to the company! Pick some questions from [this list](../non-technical/questions-to-ask.md).
 - Thank the interviewer.
 
 **Don'ts**
 
 - End the interview without asking any questions.
-- Ask about interview performance. It can get awkward.
+- Ask about your interview performance. It can get awkward.

From d3d98510b2c53019e09d6e9624c11b58d3ba1ac7 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 15:54:21 +0800
Subject: [PATCH 31/71] Add conclusion to Preparation section

---
 preparing/README.md | 26 ++++++++++++++++++++++++--
 1 file changed, 24 insertions(+), 2 deletions(-)

diff --git a/preparing/README.md b/preparing/README.md
index 1ee58cfc..58cb14b4 100644
--- a/preparing/README.md
+++ b/preparing/README.md
@@ -47,11 +47,15 @@ For phone screens/remote interviews, prepare paper and pen/pencil to jot down an
 
 Use earphones and make sure you are in a quiet environment. You definitely do not want to be holding a phone in one hand and only be able to type with the other. Try avoiding using speakers because if the echo is bad, communication is harder and repeating of words will just result in loss of valuable time.
 
+**Self Introduction**
+
+TODO
+
 **Upon Getting the Question**
 
 Many candidates jump into coding the moment they hear the question. That is usually a big mistake. Take a moment to repeat the question back at the interviewer and make sure that you understand exactly what they are asking. If you misunderstood and when you repeat back the question, they will clarify.
 
-Always seek clarification about the question upon hearing it even if it you think it is clear to you. You might discover something that you have missed out and it also sends a signal to the interviewer that you are a careful person who pays attention to details. Consider asking the following questions:
+Always seek clarification about the question upon hearing it even if it you think it is clear to you. You might discover something that you have missed out and it also sends a signal to the interviewer that you are a careful person who pays attention to details. Some interviewers deliberately omit important details to see if you ask the right questions. Consider asking the following questions:
 
 - How big is the size of the input?
 - How big is the range of values?
@@ -96,4 +100,22 @@ A great resource for practicing mock coding interviews would be [interviewing.io
 
 I have used interviewing.io both as an interviewer and an interviewee and found the experience to be really great! [Aline Lerner](https://twitter.com/alinelernerLLC), the CEO and co-founder of interviewing.io and her team are passionate about revolutionizing the technical interview process and helping candidates to improve their skills at interviewing. She has also published a number of technical interview-related articles on the [interviewing.io blog](http://blog.interviewing.io/). interviewing.io is still in beta now but I recommend signing up as early as possible to increase the likelihood of getting an invite.
 
-Another platform that allows you to practice coding interviews is [Pramp](https://pramp.com/). Where interviewing.io matches potential job seekers with seasoned technical interviewers, Pramp differs takes a different approach. Pramp pairs you up with another peer who is also a job seeker and both of you take turns to assume the role of interviewer and interviewee. Pramp also prepares questions for you, along with suggested solutions and prompts to guide the interviewee. Personally, I do not really like Pramp's approach because if I were to interview someone, I would rather choose a question I am familiar with. Also, many users of the platform do not have the experience of being interviewers and that can result in a horrible interview experience. There was once where my matched peer, as the interviewer, did not have the right understanding of the question and attempted to lead me down the wrong path of solving the question.
+Another platform that allows you to practice coding interviews is [Pramp](https://pramp.com/). Where interviewing.io matches potential job seekers with seasoned technical interviewers, Pramp takes a different approach. Pramp pairs you up with another peer who is also a job seeker and both of you take turns to assume the role of interviewer and interviewee. Pramp also prepares questions for you, along with suggested solutions and prompts to guide the interviewee.
+
+Personally, I am not that fond of Pramp's approach because if I were to interview someone, I would rather choose a question I am familiar with. Also, many users of the platform do not have the experience of being interviewers and that can result in a horrible interview experience. There was once where my matched peer, as the interviewer, did not have the right understanding of the question and attempted to lead me down the wrong path of solving the question. However, this is more of a problem of the candidate than the platform though.
+
+### Conclusion
+
+Coding interviews are tough. But fortunately, you can get better at them by studying and practicing for them, and doing mock interviews.
+To recap, to do well in coding interviews:
+
+1. Decide on a programming language
+1. Study CS fundamentals
+1. Practice solving algorithm questions
+1. Internalize the [Do's and Don'ts of interviews](./cheatsheet.md)
+1. Practice doing mock interviews
+1. Interview successfully to get the job
+
+By following these steps, you will improve your coding interview skills, and be one step closer (or probably more) to landing your dream job.
+
+All the best!

From cf398576f558dc9cdcd2417be26383fb2672b6b2 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 16:04:22 +0800
Subject: [PATCH 32/71] Convert cheatsheet to table

---
 preparing/cheatsheet.md | 133 ++++++++++++++++++----------------------
 1 file changed, 59 insertions(+), 74 deletions(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index eb46d162..350bfa96 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -7,92 +7,77 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 
 ### 1. Before Interview
 
-**Do's**
-
-- Prepare pen, paper and earphones/headphones.
-- Find a quiet environment with good Internet connection.
-- Stay calm and composed.
-- Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.
-- Dress comfortably. Usually you do not need to wear shirt and tie.
+|| Things |
+|-|-|
+|**Do's**|Prepare pen, paper and earphones/headphones.|
+||Find a quiet environment with good Internet connection.|
+||Stay calm and composed.|
+||Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
+|| Dress comfortably. Usually you do not need to wear shirt and tie.|
 
 ### 2. Introduction
 
-**Do's**
-
-- Introduce yourself in a few sentences under a minute or two.
-- Mention interesting points that are relevant to the role you are applying for.
-- Sound enthusiastic! Speak with a smile and you will naturally sound more engaging.
-
-**Don'ts**
-
-- Spend too long introducing yourself. The more time you spend talk the less time you have to code.
+|| Things |
+|-|-|
+|**Do's**|Introduce yourself in a few sentences under a minute or two.|
+||Mention interesting points that are relevant to the role you are applying for.|
+||Sound enthusiastic! Speak with a smile and you will naturally sound more engaging.|
+|**Don'ts**|Spend too long introducing yourself. The more time you spend talk the less time you have to code.|
 
 ### 3. Upon Getting the Question
 
-**Do's**
-
-- Repeat the question back at the interviewer.
-- Clarify input format and range.
-- Work through a small example to ensure you understood the question.
-- Explain a high level approach even if it is a brute force one.
-- Improve upon the approach and optimize. Reduce duplicated work and cache repeated computations.
-- Think carefully, then state and explain the time and space complexity of your approaches.
-- If stuck, think about related problems you have seen before and how they were solved. Check out the [tips](../algorithms) in this section.
-
-**Don'ts**
-
-- Ignore information given to you. Every piece is important.
-- Jump into coding straightaway.
-- Start coding without interviewer's green light.
-- Appear too unsure about your approach or analysis.
+|| Things |
+|-|-|
+|**Do's**|Repeat the question back at the interviewer.|
+||Clarify input format and range.|
+||Work through a small example to ensure you understood the question.|
+||Explain a high level approach even if it is a brute force one.|
+||Improve upon the approach and optimize. Reduce duplicated work and cache repeated computations.|
+||Think carefully, then state and explain the time and space complexity of your approaches.|
+||If stuck, think about related problems you have seen before and how they were solved. Check out the [tips](../algorithms) in this section.|
+|**Don'ts**|Ignore information given to you. Every piece is important.|
+||Jump into coding straightaway.|
+||Start coding without interviewer's green light.|
+||Appear too unsure about your approach or analysis.|
 
 ### 4. During Coding
 
-**Do's**
-
-- Practice good coding style. Clear variable names, consistent operator spacing, proper indentation, etc.
-- Defensive coding. Check for nulls, empty collections, etc.
-- Explain what you are coding/typing to the interviewer, what you are trying to achieve.
-- Type/write at a reasonable speed.
-- Write in a modular fashion. Extract out chunks of repeated code into functions.
-- Use the hints given by the interviewer.
-- Practice whiteboard space-management skills.
-- Demonstrate mastery of your chosen programming language.
-
-**Don'ts**
-
-- Remain quiet the whole time.
-- Spend too much time writing comments.
-- Use extremely verbose variable names.
-- Copy and paste code without checking.
-- Interrupt your interviewer when they are talking. Usually if they speak, they are trying to give you hints or steer you in the right direction.
-- Write too big (takes up too much space) or too small (illegible) if on a whiteboard.
+|| Things |
+|-|-|
+|**Do's**|Practice good coding style. Clear variable names, consistent operator spacing, proper indentation, etc.|
+||Defensive coding. Check for nulls, empty collections, etc.|
+||Explain what you are coding/typing to the interviewer, what you are trying to achieve.|
+||Type/write at a reasonable speed.|
+||Write in a modular fashion. Extract out chunks of repeated code into functions.|
+||Use the hints given by the interviewer.|
+||Practice whiteboard space-management skills.|
+||Demonstrate mastery of your chosen programming language.|
+|**Don'ts**|Remain quiet the whole time.|
+||Spend too much time writing comments.|
+||Use extremely verbose variable names.|
+||Copy and paste code without checking.|
+||Interrupt your interviewer when they are talking. Usually if they speak, they are trying to give you hints or steer you in the right direction.|
+||Write too big (takes up too much space) or too small (illegible) if on a whiteboard.|
 
 ### 5. After Coding
 
-**Do's**
-
-- Scan through your code for mistakes as if it was your first time seeing code written by someone else.
-- Check for off-by-one errors.
-- Come up with more test cases. Try extreme test cases.
-- Step through your code with those test cases.
-- Look out for places where you can refactor.
-- Reiterate the time and space complexity of your code.
-- Explain trade-offs and how the code/approach can be improved if given more time.
-
-**Don'ts**
-
-- Immediately announce that you are done coding.
-- Argue with the interviewer.
+|| Things |
+|-|-|
+|**Do's**|Scan through your code for mistakes as if it was your first time seeing code written by someone else.|
+||Check for off-by-one errors.|
+||Come up with more test cases. Try extreme test cases.|
+||Step through your code with those test cases.|
+||Look out for places where you can refactor.|
+||Reiterate the time and space complexity of your code.|
+||Explain trade-offs and how the code/approach can be improved if given more time.|
+|**Don'ts**|Immediately announce that you are done coding.|
+||Argue with the interviewer.|
 
 ### 6. Wrap Up
 
-**Do's**
-
-- Ask questions. More importantly, ask good and engaging questions that are tailored to the company! Pick some questions from [this list](../non-technical/questions-to-ask.md).
-- Thank the interviewer.
-
-**Don'ts**
-
-- End the interview without asking any questions.
-- Ask about your interview performance. It can get awkward.
+|| Things |
+|-|-|
+|**Do's**|Ask questions. More importantly, ask good and engaging questions that are tailored to the company! Pick some questions from [this list](../non-technical/questions-to-ask.md).|
+||Thank the interviewer.|
+|**Don'ts**|End the interview without asking any questions.|
+||Ask about your interview performance. It can get awkward.|

From abf34b8696a17a80c63b978c2b75b8e0ad06bc83 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 16:13:53 +0800
Subject: [PATCH 33/71] =?UTF-8?q?Change=20cheatsheet=20Do's=20and=20Don'ts?=
 =?UTF-8?q?=20to=20emojis=20=E2=9C=85=20=E2=9D=8C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 preparing/cheatsheet.md | 94 ++++++++++++++++++++---------------------
 1 file changed, 47 insertions(+), 47 deletions(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 350bfa96..78cd06c2 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -9,75 +9,75 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 
 || Things |
 |-|-|
-|**Do's**|Prepare pen, paper and earphones/headphones.|
-||Find a quiet environment with good Internet connection.|
-||Stay calm and composed.|
-||Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
-|| Dress comfortably. Usually you do not need to wear shirt and tie.|
+|✅|Prepare pen, paper and earphones/headphones.|
+|✅|Find a quiet environment with good Internet connection.|
+|✅|Stay calm and composed.|
+|✅|Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
+|✅| Dress comfortably. Usually you do not need to wear shirt and tie.|
 
 ### 2. Introduction
 
 || Things |
 |-|-|
-|**Do's**|Introduce yourself in a few sentences under a minute or two.|
-||Mention interesting points that are relevant to the role you are applying for.|
-||Sound enthusiastic! Speak with a smile and you will naturally sound more engaging.|
-|**Don'ts**|Spend too long introducing yourself. The more time you spend talk the less time you have to code.|
+|✅|Introduce yourself in a few sentences under a minute or two.|
+|✅|Mention interesting points that are relevant to the role you are applying for.|
+|✅|Sound enthusiastic! Speak with a smile and you will naturally sound more engaging.|
+|❌|Spend too long introducing yourself. The more time you spend talk the less time you have to code.|
 
 ### 3. Upon Getting the Question
 
 || Things |
 |-|-|
-|**Do's**|Repeat the question back at the interviewer.|
-||Clarify input format and range.|
-||Work through a small example to ensure you understood the question.|
-||Explain a high level approach even if it is a brute force one.|
-||Improve upon the approach and optimize. Reduce duplicated work and cache repeated computations.|
-||Think carefully, then state and explain the time and space complexity of your approaches.|
-||If stuck, think about related problems you have seen before and how they were solved. Check out the [tips](../algorithms) in this section.|
-|**Don'ts**|Ignore information given to you. Every piece is important.|
-||Jump into coding straightaway.|
-||Start coding without interviewer's green light.|
-||Appear too unsure about your approach or analysis.|
+|✅|Repeat the question back at the interviewer.|
+|✅|Clarify input format and range.|
+|✅|Work through a small example to ensure you understood the question.|
+|✅|Explain a high level approach even if it is a brute force one.|
+|✅|Improve upon the approach and optimize. Reduce duplicated work and cache repeated computations.|
+|✅|Think carefully, then state and explain the time and space complexity of your approaches.|
+|✅|If stuck, think about related problems you have seen before and how they were solved. Check out the [tips](../algorithms) in this section.|
+|❌|Ignore information given to you. Every piece is important.|
+|❌|Jump into coding straightaway.|
+|❌|Start coding without interviewer's green light.|
+|❌|Appear too unsure about your approach or analysis.|
 
 ### 4. During Coding
 
 || Things |
 |-|-|
-|**Do's**|Practice good coding style. Clear variable names, consistent operator spacing, proper indentation, etc.|
-||Defensive coding. Check for nulls, empty collections, etc.|
-||Explain what you are coding/typing to the interviewer, what you are trying to achieve.|
-||Type/write at a reasonable speed.|
-||Write in a modular fashion. Extract out chunks of repeated code into functions.|
-||Use the hints given by the interviewer.|
-||Practice whiteboard space-management skills.|
-||Demonstrate mastery of your chosen programming language.|
-|**Don'ts**|Remain quiet the whole time.|
-||Spend too much time writing comments.|
-||Use extremely verbose variable names.|
-||Copy and paste code without checking.|
-||Interrupt your interviewer when they are talking. Usually if they speak, they are trying to give you hints or steer you in the right direction.|
-||Write too big (takes up too much space) or too small (illegible) if on a whiteboard.|
+|✅|Practice good coding style. Clear variable names, consistent operator spacing, proper indentation, etc.|
+|✅|Defensive coding. Check for nulls, empty collections, etc.|
+|✅|Explain what you are coding/typing to the interviewer, what you are trying to achieve.|
+|✅|Type/write at a reasonable speed.|
+|✅|Write in a modular fashion. Extract out chunks of repeated code into functions.|
+|✅|Use the hints given by the interviewer.|
+|✅|Practice whiteboard space-management skills.|
+|✅|Demonstrate mastery of your chosen programming language.|
+|❌|Remain quiet the whole time.|
+|❌|Spend too much time writing comments.|
+|❌|Use extremely verbose variable names.|
+|❌|Copy and paste code without checking.|
+|❌|Interrupt your interviewer when they are talking. Usually if they speak, they are trying to give you hints or steer you in the right direction.|
+|❌|Write too big (takes up too much space) or too small (illegible) if on a whiteboard.|
 
 ### 5. After Coding
 
 || Things |
 |-|-|
-|**Do's**|Scan through your code for mistakes as if it was your first time seeing code written by someone else.|
-||Check for off-by-one errors.|
-||Come up with more test cases. Try extreme test cases.|
-||Step through your code with those test cases.|
-||Look out for places where you can refactor.|
-||Reiterate the time and space complexity of your code.|
-||Explain trade-offs and how the code/approach can be improved if given more time.|
-|**Don'ts**|Immediately announce that you are done coding.|
-||Argue with the interviewer.|
+|✅|Scan through your code for mistakes as if it was your first time seeing code written by someone else.|
+|✅|Check for off-by-one errors.|
+|✅|Come up with more test cases. Try extreme test cases.|
+|✅|Step through your code with those test cases.|
+|✅|Look out for places where you can refactor.|
+|✅|Reiterate the time and space complexity of your code.|
+|✅|Explain trade-offs and how the code/approach can be improved if given more time.|
+|❌|Immediately announce that you are done coding.|
+|❌|Argue with the interviewer.|
 
 ### 6. Wrap Up
 
 || Things |
 |-|-|
-|**Do's**|Ask questions. More importantly, ask good and engaging questions that are tailored to the company! Pick some questions from [this list](../non-technical/questions-to-ask.md).|
-||Thank the interviewer.|
-|**Don'ts**|End the interview without asking any questions.|
-||Ask about your interview performance. It can get awkward.|
+|✅|Ask questions. More importantly, ask good and engaging questions that are tailored to the company! Pick some questions from [this list](../non-technical/questions-to-ask.md).|
+|✅|Thank the interviewer.|
+|❌|End the interview without asking any questions.|
+|❌|Ask about your interview performance. It can get awkward.|

From 2c17675e20a03c1abd757baec87aaa6c0a36e9e6 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 16:25:38 +0800
Subject: [PATCH 34/71] Fix cheatsheet wording

---
 preparing/cheatsheet.md | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 78cd06c2..0538be04 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -13,7 +13,7 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Find a quiet environment with good Internet connection.|
 |✅|Stay calm and composed.|
 |✅|Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
-|✅| Dress comfortably. Usually you do not need to wear shirt and tie.|
+|✅|Dress comfortably. T-shirts and jeans are acceptable at most places.|
 
 ### 2. Introduction
 
@@ -50,8 +50,9 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Type/write at a reasonable speed.|
 |✅|Write in a modular fashion. Extract out chunks of repeated code into functions.|
 |✅|Use the hints given by the interviewer.|
-|✅|Practice whiteboard space-management skills.|
 |✅|Demonstrate mastery of your chosen programming language.|
+|✅|Demonstrate technical knowledge in data structures and algorithms.|
+|✅|Practice whiteboard space-management skills.|
 |❌|Remain quiet the whole time.|
 |❌|Spend too much time writing comments.|
 |❌|Use extremely verbose variable names.|

From 91f799a02b61aeaeec7caccafd9295d904eb19b5 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 16:26:18 +0800
Subject: [PATCH 35/71] Improve cheatsheet point on dress code

---
 preparing/cheatsheet.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 0538be04..367a2673 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -13,7 +13,7 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Find a quiet environment with good Internet connection.|
 |✅|Stay calm and composed.|
 |✅|Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
-|✅|Dress comfortably. T-shirts and jeans are acceptable at most places.|
+|✅|Dress comfortably. Usually you do not need to wear smart clothes, casual should be fine. T-shirts and jeans are acceptable at most places.|
 
 ### 2. Introduction
 

From b0b8d4918790be1c1ad8e25a20730c82bfe6289b Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 18:19:16 +0800
Subject: [PATCH 36/71] Fix for HN comments

---
 preparing/cheatsheet.md | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 367a2673..60455e21 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -11,9 +11,12 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |-|-|
 |✅|Prepare pen, paper and earphones/headphones.|
 |✅|Find a quiet environment with good Internet connection.|
+|✅|Ensure webcam and audio are working. There were times I had to restart Chrome to get Hangouts to work again.|
 |✅|Stay calm and composed.|
 |✅|Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
+|✅|Request for the option to interview over Hangouts/Skype instead of a phone call; it is easier to send links or text across.|
 |✅|Dress comfortably. Usually you do not need to wear smart clothes, casual should be fine. T-shirts and jeans are acceptable at most places.|
+|⚠️|Turn off the webcam if possible. Most remote interviews will not require video chat and leaving it on only serves as distractions.|
 
 ### 2. Introduction
 
@@ -29,7 +32,7 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 || Things |
 |-|-|
 |✅|Repeat the question back at the interviewer.|
-|✅|Clarify input format and range.|
+|✅|Clarify input format and range. Ask whether input can be assumed to be well-formed and non-null.|
 |✅|Work through a small example to ensure you understood the question.|
 |✅|Explain a high level approach even if it is a brute force one.|
 |✅|Improve upon the approach and optimize. Reduce duplicated work and cache repeated computations.|
@@ -44,15 +47,15 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 
 || Things |
 |-|-|
-|✅|Practice good coding style. Clear variable names, consistent operator spacing, proper indentation, etc.|
-|✅|Defensive coding. Check for nulls, empty collections, etc.|
 |✅|Explain what you are coding/typing to the interviewer, what you are trying to achieve.|
+|✅|Practice good coding style. Clear variable names, consistent operator spacing, proper indentation, etc.|
 |✅|Type/write at a reasonable speed.|
 |✅|Write in a modular fashion. Extract out chunks of repeated code into functions.|
 |✅|Use the hints given by the interviewer.|
 |✅|Demonstrate mastery of your chosen programming language.|
 |✅|Demonstrate technical knowledge in data structures and algorithms.|
 |✅|Practice whiteboard space-management skills.|
+|⚠️|Reasonable defensive coding. Check for nulls, empty collections, etc. Can omit if input validity has been clarified with the interviewer.|
 |❌|Remain quiet the whole time.|
 |❌|Spend too much time writing comments.|
 |❌|Use extremely verbose variable names.|

From 60aee3771d3708cf9bbd038d1e0995c1767dfa70 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 18:28:48 +0800
Subject: [PATCH 37/71] Add questions from "Questions I'm asking in interviews
 2017"

---
 non-technical/questions-to-ask.md | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/non-technical/questions-to-ask.md b/non-technical/questions-to-ask.md
index e2239d04..322b1952 100644
--- a/non-technical/questions-to-ask.md
+++ b/non-technical/questions-to-ask.md
@@ -26,6 +26,7 @@ Here are some good questions to ask at the end of the interview, extracted from
 - **What is something you wish were different about your job?**
 - How will the work I will be doing contribute to the organization's mission?
 - What do you like about working here?
+- What is your policy on working from home/remotely?
 - (If the company is a startup) When was the last time you interacted with a founder? What was it regarding? Generally how involved are the founders in the day-to-day?
 - Does the company culture encourage entrepreneurship? Could you give me any specific examples?
 
@@ -37,6 +38,7 @@ These questions are suitable for any technical role.
 - **What has been the worst technical blunder that has happened in the recent past? How did you guys deal with it? What changes were implemented afterwards to make sure it didn't happen again?**
 - **What is the most costly technical decision made early on that the company is living with now?**
 - **What is the most fulfilling/exciting/technically complex project that you've worked on here so far?**
+- How do you evaluate new technologies? Who makes the final decisions?
 - How do you know what to work on each day?
 - How would you describe your engineering culture?
 - How has your role changed since joining the company?
@@ -65,12 +67,14 @@ These questions are suitable for asking Engineering Managers, especially useful
 - **What does success look like for your team?**
 - **What qualities do you look out for when hiring for this role?**
 - **What are the strengths and weaknesses of the current team? What is being done to improve upon the weaknesses?**
+- **Can you tell me about a time you resolved an interpersonal conflict?**
 - How did you become a manager?
 - How do your engineers know what to work on each day?
 - What is your team's biggest challenge right now?
 - How do you measure individual performance?
 - How often are 1:1s conducted?
 - What is the current team composition like?
+- What opportunities are available to switch roles? How does this work?
 
 ### Leadership
 
@@ -103,3 +107,4 @@ These questions are intended for senior level management, such as CEO, CTO, VPs.
 - [How to interview your interviewers](http://blog.alinelerner.com/how-to-interview-your-interviewers/)
 - [How to Break Into the Tech Industry—a Guide to Job Hunting and Tech Interviews](https://haseebq.com/how-to-break-into-tech-job-hunting-and-interviews/)
 - [A developer's guide to interviewing](https://medium.freecodecamp.org/how-to-interview-as-a-developer-candidate-b666734f12dd)
+- [Questions I'm asking in interviews 2017](https://cternus.net/blog/2017/10/10/questions-i-m-asking-in-interviews-2017/)

From bfa350013c157bbc2a03226e0e81430a7d28e183 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 19:43:52 +0800
Subject: [PATCH 38/71] Clean up resume tips

---
 non-technical/resume.md | 15 +++++----------
 preparing/cheatsheet.md |  2 +-
 2 files changed, 6 insertions(+), 11 deletions(-)

diff --git a/non-technical/resume.md b/non-technical/resume.md
index b77fe359..0c6290f6 100644
--- a/non-technical/resume.md
+++ b/non-technical/resume.md
@@ -67,13 +67,14 @@ Information that a recruiter wants to know:
 
 Information nobody needs to know:
 
+- Your profile picture.
 - Address, home phone number, gender, religion, race, marital status, etc etc.
 - Elementary, middle, high school.
 - Your low GPA.
 - Anything less recent than 3-4 years unless they are valid job experiences.
 - Anything about your parents/siblings, their names, occupation, etc.
 - Your life story.
-- Anything not relevant to the job you are applying for (eg. that you have a driving license when you are applying to be a programmer).
+- Anything not relevant to the job you are applying for (e.g. that you have a driving license when you are applying to be a programmer).
 
 Ideally, keep it short, concise, but as detailed as possible.
 
@@ -107,7 +108,7 @@ Always list your resume in reverse chronological order - the most recent at the
 - Avoid emails like "me@christi.na" or "admin@[mycooldomain].com" -- because it is very prone to typo errors.
 - Make sure the number you have listed is the best way to reach you. The last thing you want is to miss the call from the recruiter because you typed the wrong number, or you are not available on that number during office hours (most probably the times the recruiter will call).
 
-#### 7. Formatting/Design
+#### 7. Layout/Formatting/Design
 
 - Be consistent about the way you format your resume. Italics, underline, bold, and how they are used.
 - Keep to a single standard font (avoid fancy fonts like Comic Sans or whatever) and do not have too many varying styles/font sizes/color
@@ -118,6 +119,8 @@ Always list your resume in reverse chronological order - the most recent at the
 - Be consistent about bullet points.
 - Your resume should not look sparse. (Come on, it is only 1 page!) If you really have trouble filling it up, you are either not thinking hard enough, or not doing enough. In the case of the latter, consider working on your personal projects (i.e. stuff you can post on GitHub). That said, do not write stuff just to fill space. Read point 4.
 - This should be common sense, but do not commit fraud, i.e. apply for the same job using a different name, or using your friend's resume to apply for the same job. Some ATS issues an indicator if they suspect the application to be a duplicate.
+- It's important to note the layout of your resume. If you choose to quickly upload your resume via an auto-fill program, understand that the program will read your resume from top to bottom, left to right. This is good to keep in mind when developing the layout of your resume.
+- Try to keep white space down to a minimum. This will also help reduce the length of your resume to one page. Reduce margins and paddings reasonably.
 
 #### 8. Listing Your skills
 
@@ -138,14 +141,6 @@ Here's the news - Recruiters do search for your name! Definitely pre-empt that b
 
 If you have some space on your resume, it is good to list additional interests outside of coding. Eg. skiing, water sports, soccer, etc etc. Gives the interviewer something to talk to you about. It also shows that you are a well-rounded individual/cool person to hang out with.
 
-#### 11. Resume Layout
-
-Absolutely, no headshots.
-
-It's important to note the layout of your resume. If you choose to quickly upload your resume via an auto-fill program, understand that the program will read your resume from top to bottom, left to right. This is good to keep in mind when developing the layout of your resume.
-
-Try to keep white space down to a minimum. This will also help reduce the length of your resume to one page. For instance, white space usually exists near the sides of your resume. Use that space to list out your skills in a vertical column!
-
 ###### References
 
 - [Screening your resume is like playing word search](https://medium.com/@christinang89/screening-your-resume-is-like-playing-word-search-60f4d0e60840)
diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 60455e21..6b706cff 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -16,7 +16,7 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
 |✅|Request for the option to interview over Hangouts/Skype instead of a phone call; it is easier to send links or text across.|
 |✅|Dress comfortably. Usually you do not need to wear smart clothes, casual should be fine. T-shirts and jeans are acceptable at most places.|
-|⚠️|Turn off the webcam if possible. Most remote interviews will not require video chat and leaving it on only serves as distractions.|
+|⚠️|Turn off the webcam if possible. Most remote interviews will not require video chat and leaving it on only serves as a distraction.|
 
 ### 2. Introduction
 

From 08e23d0b6c742e69c7634230ac14aa77392ef485 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sat, 14 Oct 2017 20:32:11 +0800
Subject: [PATCH 39/71] More cheatsheet tips

---
 algorithms/README.md    |  6 ++++--
 preparing/cheatsheet.md | 21 ++++++++++++++++-----
 2 files changed, 20 insertions(+), 7 deletions(-)

diff --git a/algorithms/README.md b/algorithms/README.md
index ef59cf33..d774faed 100644
--- a/algorithms/README.md
+++ b/algorithms/README.md
@@ -29,6 +29,8 @@ If you are interested in how data structures are implemented, check out [Lago](h
 
 ## General Tips
 
+Clarify any assumptions you made subconsciously. Many questions are under-specified on purpose.
+
 Always validate input first. Check for invalid/empty/negative/different type input. Never assume you are given the valid parameters. Alternatively, clarify with the interviewer whether you can assume valid input (usually yes), which can save you time from writing code that does input validation.
 
 Are there any time/space complexity requirements/constraints?
@@ -58,7 +60,7 @@ Data structures can be augmented to achieve efficient time complexities across d
 
 Hashmaps are probably the most commonly used data structure for algorithm questions. If you are stuck on a question, your last resort can be to enumerate through the possible data structures (thankfully there aren't that many of them) and consider whether each of them can be applied to the problem. This has worked for me sometimes.
 
-If you are cutting corners in your code, state that out loud to your interviewer and say what you would do in a non-interview setting (no time constraints). E.g., I would write a regex to parse this string rather than using `split()` which does not cover all cases.
+If you are cutting corners in your code, state that out loud to your interviewer and say what you would do in a non-interview setting (no time constraints). E.g., I would write a regex to parse this string rather than using `split()` which may not cover all cases.
 
 ## Sequence
 
@@ -191,7 +193,7 @@ You can be given a list of edges and tasked to build your own graph from the edg
   - Adjacency list.
   - Hashmap of hashmaps.
 
-Some inputs look like they are trees but they are actually graphs. In that case you will have to handle cycles and keep a set of visited nodes when traversing.
+A tree-like diagram could very well be a graph that allows for cycles and a naive recursive solution would not work. In that case you will have to handle cycles and keep a set of visited nodes when traversing.
 
 #### Graph search algorithms:
 
diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 6b706cff..d08ce1ce 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -1,7 +1,7 @@
 Interview Cheatsheet
 ==
 
-This is a straight-to-the-point distilled list of technical interview Do's and Don'ts. Some of these may apply to only phone screens on whiteboard interviews but most will apply to both. I revise this list before each of my interviews to remind myself of them and eventually internalized all of them to the point I do not have to rely on it anymore.
+This is a straight-to-the-point distilled list of technical interview Do's and Don'ts, mainly for algorithmic interviews. Some of these may apply to only phone screens on whiteboard interviews but most will apply to both. I revise this list before each of my interviews to remind myself of them and eventually internalized all of them to the point I do not have to rely on it anymore.
 
 For a detailed walkthrough of interview preparation, refer to the ["Preparing for a Coding Interview"](./) section.
 
@@ -12,10 +12,13 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Prepare pen, paper and earphones/headphones.|
 |✅|Find a quiet environment with good Internet connection.|
 |✅|Ensure webcam and audio are working. There were times I had to restart Chrome to get Hangouts to work again.|
-|✅|Stay calm and composed.|
-|✅|Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
 |✅|Request for the option to interview over Hangouts/Skype instead of a phone call; it is easier to send links or text across.|
+|✅|Decide on and be familiar with a programming language.|
+|✅|Familiarize yourself with the coding environment (CoderPad/CodePen). Set up the coding shortcuts, turn on autocompletion, tab spacing, etc.|
+|✅|Prepare answers to the [frequently-asked questions](../non-technical/behavioral.md) in an interview.|
+|✅|Prepare some [questions to ask](../non-technical/questions-to-ask.md) at the end of the interview.|
 |✅|Dress comfortably. Usually you do not need to wear smart clothes, casual should be fine. T-shirts and jeans are acceptable at most places.|
+|✅|Stay calm and composed.|
 |⚠️|Turn off the webcam if possible. Most remote interviews will not require video chat and leaving it on only serves as a distraction.|
 
 ### 2. Introduction
@@ -32,6 +35,7 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 || Things |
 |-|-|
 |✅|Repeat the question back at the interviewer.|
+|✅|Clarify any assumptions you made subconsciously. Many questions are under-specified on purpose. A tree-like diagram could very well be a graph that allows for cycles and a naive recursive solution would not work.|
 |✅|Clarify input format and range. Ask whether input can be assumed to be well-formed and non-null.|
 |✅|Work through a small example to ensure you understood the question.|
 |✅|Explain a high level approach even if it is a brute force one.|
@@ -50,10 +54,13 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Explain what you are coding/typing to the interviewer, what you are trying to achieve.|
 |✅|Practice good coding style. Clear variable names, consistent operator spacing, proper indentation, etc.|
 |✅|Type/write at a reasonable speed.|
+|✅|As much as possible, write actual compilable code, not pseudocode.|
 |✅|Write in a modular fashion. Extract out chunks of repeated code into functions.|
+|✅|Ask for permission to use trivial functions without having to implement them; saves you some time.|
 |✅|Use the hints given by the interviewer.|
 |✅|Demonstrate mastery of your chosen programming language.|
 |✅|Demonstrate technical knowledge in data structures and algorithms.|
+|✅|If you are cutting corners in your code, state that out loud to your interviewer and say what you would do in a non-interview setting (no time constraints). E.g., I would write a regex to parse this string rather than using `split()` which may not cover all cases.|
 |✅|Practice whiteboard space-management skills.|
 |⚠️|Reasonable defensive coding. Check for nulls, empty collections, etc. Can omit if input validity has been clarified with the interviewer.|
 |❌|Remain quiet the whole time.|
@@ -74,8 +81,8 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Look out for places where you can refactor.|
 |✅|Reiterate the time and space complexity of your code.|
 |✅|Explain trade-offs and how the code/approach can be improved if given more time.|
-|❌|Immediately announce that you are done coding.|
-|❌|Argue with the interviewer.|
+|❌|Immediately announce that you are done coding. Do the above first!|
+|❌|Argue with the interviewer. They may be wrong but that is very unlikely given that they are familiar with the question.|
 
 ### 6. Wrap Up
 
@@ -85,3 +92,7 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Thank the interviewer.|
 |❌|End the interview without asking any questions.|
 |❌|Ask about your interview performance. It can get awkward.|
+
+###### References
+
+- [Preparing for a Facebook/Google Software Engineer Interview](https://orrsella.com/2016/05/14/preparing-for-a-facebook-google-software-engineer-interview/)

From a667bcc7228aef75c0398219a0e7c1f36ab26bb1 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Sun, 15 Oct 2017 01:52:28 +0800
Subject: [PATCH 40/71] =?UTF-8?q?Add=20=F0=9F=86=95=20label=20to=20Intervi?=
 =?UTF-8?q?ew=20Cheatsheet?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 1cc0b701..4366a6b9 100644
--- a/README.md
+++ b/README.md
@@ -16,7 +16,7 @@
 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](preparing) for coding interviews
-- [Interview Cheatsheet](preparing/cheatsheet.md) - Straight-to-the-point Do's and Don'ts
+- [Interview Cheatsheet](preparing/cheatsheet.md) - Straight-to-the-point Do's and Don'ts 🆕
 - [Algorithm tips and the best practice questions](algorithms) categorized by topic
 - ["Front-end Job Interview Questions" answers](front-end/interview-questions.md)
 - [Interview formats](non-technical/interview-formats.md) of the top tech companies

From dcde5c5dbefc9587bcbbcfdcb2662c73be117528 Mon Sep 17 00:00:00 2001
From: Rahul Janagouda <rahul.janagouda@gmail.com>
Date: Sun, 15 Oct 2017 14:27:10 +0530
Subject: [PATCH 41/71] Add legend to cheatsheet (#45)

Add legend to cheatsheet
---
 preparing/cheatsheet.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index d08ce1ce..11ab62b0 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -5,6 +5,8 @@ This is a straight-to-the-point distilled list of technical interview Do's and D
 
 For a detailed walkthrough of interview preparation, refer to the ["Preparing for a Coding Interview"](./) section.
 
+**Legend:** ✅ = Do, ❌ = Don't, ⚠️ = Situational
+
 ### 1. Before Interview
 
 || Things |
@@ -90,8 +92,8 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |-|-|
 |✅|Ask questions. More importantly, ask good and engaging questions that are tailored to the company! Pick some questions from [this list](../non-technical/questions-to-ask.md).|
 |✅|Thank the interviewer.|
+|⚠️|Ask about your interview performance. It can get awkward.|
 |❌|End the interview without asking any questions.|
-|❌|Ask about your interview performance. It can get awkward.|
 
 ###### References
 

From f2bcca85a31be32fc7fcaf6ccec4d298ba32bbfb Mon Sep 17 00:00:00 2001
From: Chang Yan <thomasyim94@gmail.com>
Date: Sun, 15 Oct 2017 16:03:23 -0400
Subject: [PATCH 42/71] Add async and await in the Async section (#46)

---
 front-end/javascript.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/front-end/javascript.md b/front-end/javascript.md
index 30bd8e3f..6278f652 100644
--- a/front-end/javascript.md
+++ b/front-end/javascript.md
@@ -61,6 +61,7 @@ WIP.
   - https://css-tricks.com/debouncing-throttling-explained-examples/
 - Callbacks
 - [Promises](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise)
+- [Async](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function) and [Await](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/await) in ES7
 
 **Reference**
 

From 7870a58b31069c2f25b95b2529dfe5c082e05785 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Can=20G=C3=BCney=20Aksakalli?= <cgaksakalli@gmail.com>
Date: Mon, 16 Oct 2017 11:20:36 +0200
Subject: [PATCH 43/71] Fix typos (#47)

---
 algorithms/array.md                | 2 +-
 algorithms/matrix.md               | 2 +-
 front-end/interview-questions.md   | 2 +-
 non-technical/behavioral.md        | 6 +++---
 non-technical/self-introduction.md | 2 +-
 5 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/algorithms/array.md b/algorithms/array.md
index 016e3fbc..4027cfaa 100644
--- a/algorithms/array.md
+++ b/algorithms/array.md
@@ -1,7 +1,7 @@
 Arrays
 ==
 
-- In an arrays of arrays, e.g. given `[[], [1, 2, 3], [4, 5], [], [], [6, 7], [8], [9, 10], [], []]`, print: `1, 2, 3, 4, 5, 6, 7, 8, 9, 10`.
+- In an array of arrays, e.g. given `[[], [1, 2, 3], [4, 5], [], [], [6, 7], [8], [9, 10], [], []]`, print: `1, 2, 3, 4, 5, 6, 7, 8, 9, 10`.
   - Implement an iterator that supports `hasNext()`, `next()` and `remove()` methods.
 - Given a list of item prices, find all possible combinations of items that sum a particular value `K`.
 - Paginate an array with constraints, such as skipping certain items.
diff --git a/algorithms/matrix.md b/algorithms/matrix.md
index 6093c692..a0977e9e 100644
--- a/algorithms/matrix.md
+++ b/algorithms/matrix.md
@@ -3,7 +3,7 @@ Matrix
 
 - You're given a 3 x 3 board of a tile puzzle, with 8 tiles numbered 1 to 8, and an empty spot. You can move any tile adjacent to the empty spot, to the empty spot, creating an empty spot where the tile originally was. The goal is to find a series of moves that will solve the board, i.e. get `[[1, 2, 3], [4, 5, 6], [7, 8, - ]]` where - is the empty tile.
 - Boggle implementation. Given a dictionary, and a matrix of letters, find all the words in the matrix that are in the dictionary. You can go across, down or diagonally.
-- The values of the matrix will represent numbers of carrots available to the rabbit in each square of the garden. If the garden does not have an exact center, the rabbit should start in the square closest to the center with the highest carrot count. On a given turn, the rabbit will eat the carrots available on the square that it is on, and then move up, down, left, or right, choosing the the square that has the most carrots. If there are no carrots left on any of the adjacent squares, the rabbit will go to sleep. You may assume that the rabbit will never have to choose between two squares with the same number of carrots. Write a function which takes a garden matrix and returns the number of carrots the rabbit eats. You may assume the matrix is rectangular with at least 1 row and 1 column, and that it is populated with non-negative integers. For example,
+- The values of the matrix will represent numbers of carrots available to the rabbit in each square of the garden. If the garden does not have an exact center, the rabbit should start in the square closest to the center with the highest carrot count. On a given turn, the rabbit will eat the carrots available on the square that it is on, and then move up, down, left, or right, choosing the square that has the most carrots. If there are no carrots left on any of the adjacent squares, the rabbit will go to sleep. You may assume that the rabbit will never have to choose between two squares with the same number of carrots. Write a function which takes a garden matrix and returns the number of carrots the rabbit eats. You may assume the matrix is rectangular with at least 1 row and 1 column, and that it is populated with non-negative integers. For example,
   - Example: `[[5, 7, 8, 6, 3], [0, 0, 7, 0, 4], [4, 6, 3, 4, 9], [3, 1, 0, 5, 8]]` should return `27`.
 - Print a matrix in a spiral fashion.
 - In the Game of life, calculate how to compute the next state of the board. Follow up was to do it if there were memory constraints (board represented by a 1 TB file).
diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index 70031168..9630684c 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -766,7 +766,7 @@ This question is pretty vague. My best guess at its intention is that it is aski
 
 `var person = Person()` invokes the `Person` as a function, and not as a constructor. Invoking as such is a common mistake if it the function is intended to be used as a constructor. Typically, the constructor does not return anything, hence invoking the constructor like a normal function will return `undefined` and that gets assigned to the variable intended as the instance.
 
-`var person = new Person()` creates an instance of the `Person` object using the `new` operator, which inherits from `Person.prototype`. An alterative would be to use `Object.create`, such as: `Object.create(Person.prototype)`.
+`var person = new Person()` creates an instance of the `Person` object using the `new` operator, which inherits from `Person.prototype`. An alternative would be to use `Object.create`, such as: `Object.create(Person.prototype)`.
 
 ```js
 function Person(name) {
diff --git a/non-technical/behavioral.md b/non-technical/behavioral.md
index ce84afe0..f3492f46 100644
--- a/non-technical/behavioral.md
+++ b/non-technical/behavioral.md
@@ -13,7 +13,7 @@ Learn the [STAR](https://en.wikipedia.org/wiki/Situation,_task,_action,_result)
 - Why do you want to work for X company?
 - Why do you want to leave your current/last company?
 - What are you looking for in your next role?
-- Tell me about a time where you had a conflict with a co-worker.
+- Tell me about a time when you had a conflict with a co-worker.
 - Tell me about a time in which you had a conflict and needed to influence somebody else.
 - What project are you currently working on?
 - What is the most challenging aspect of your current project?
@@ -93,7 +93,7 @@ Source: [Glassdoor](https://hired.com/blog/candidates/10-top-interview-questions
 - Why are you looking to leave your current company?
 - What is your biggest strength and area of growth?
 - Tell me about a time your work responsibilities got a little overwhelming. What did you do?
-- Give me an example of a time where you had a difference of opinion with a team member. How did you handle that?
+- Give me an example of a time when you had a difference of opinion with a team member. How did you handle that?
 - Tell me about a challenge you faced recently in your role. How did you tackle it? What was the outcome?
 - Where do you want to be in five years?
 - Tell me about a time you needed information from someone who wasn't responsive. What did you do?
@@ -154,7 +154,7 @@ Source: [Glassdoor](https://hired.com/blog/candidates/10-top-interview-questions
 
 Source: [Glassdoor](https://www.glassdoor.com/Interview/Stripe-Interview-Questions-E671932.htm)
 
-- How do you stay up to date with latest technologies?
+- How do you stay up to date with the latest technologies?
 - Explain a project that you worked on recently that was difficult.
 - Where do you see yourself in five years?
 
diff --git a/non-technical/self-introduction.md b/non-technical/self-introduction.md
index 6f78a8fc..7e5e0fea 100644
--- a/non-technical/self-introduction.md
+++ b/non-technical/self-introduction.md
@@ -20,7 +20,7 @@ The Elevator Pitch is an indispensable tool for you as you move forward in your
 - PRACTICE!
   - Lastly, you must practice your pitch! Having a great, succinct summary of your skills only helps if you can actually deliver it rapidly! You should practice keeping a quick but easy-to-follow pace that won't overwhelm them but won't bore them. It's a precarious balance, but can be ironed out with practice.
 
-Having an Elevator Pitch on hand is a great way to create a network and happen upon new job opportunities. There will often be times where you can't prepare for an interview or meeting, and it is incredibly handy to have a practiced pitch.
+Having an Elevator Pitch on hand is a great way to create a network and happen upon new job opportunities. There will often be times when you can't prepare for an interview or meeting, and it is incredibly handy to have a practiced pitch.
 
 ###### References
 

From 10281f10b072ff74a0980a6c73970242bef916e5 Mon Sep 17 00:00:00 2001
From: Suyash Lakhotia <suyashlakhotia@gmail.com>
Date: Tue, 17 Oct 2017 00:07:21 +0800
Subject: [PATCH 44/71] Fix missing study link for Trie (#50)

---
 algorithms/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/algorithms/README.md b/algorithms/README.md
index d774faed..abc4ca9e 100644
--- a/algorithms/README.md
+++ b/algorithms/README.md
@@ -536,7 +536,7 @@ When a question involves a BST, the interviewer is usually looking for a solutio
 #### Study Links
 
 - [Trying to Understand Tries](https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014)
-- [Implement Trie (Prefix Tree)]
+- [Implement Trie (Prefix Tree)](https://leetcode.com/articles/implement-trie-prefix-tree/)
 
 #### Notes
 

From ff8f3e1edf6440cd40f2a7b8a552f4ef68dd106a Mon Sep 17 00:00:00 2001
From: Ziyaddin Sadigov <ziyaddinsadigov@gmail.com>
Date: Mon, 16 Oct 2017 22:13:22 +0400
Subject: [PATCH 45/71] Fix typos (#51)

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 4366a6b9..5735622b 100644
--- a/README.md
+++ b/README.md
@@ -38,7 +38,7 @@ Anybody who wants to land a job at a tech company but is new to technical interv
 
 There are so many awesome books like [Cracking the Coding Interview](http://www.crackingthecodinginterview.com/) 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. 😎
+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. 😎
 
 ## Contents
 
@@ -56,7 +56,7 @@ Also, existing resources focus mainly on algorithm questions, and lack in covera
   - [Questions to Ask](non-technical/questions-to-ask.md)
   - [Negotiation Tips](non-technical/negotiation.md)
 - **[Utilities](utilities)** - Snippets of algorithms/code that will help in coding questions
-  - **UPDATE** - Check out [Lago](https://github.com/yangshun/lago), which is a Data Structures and Algorithms library that contains more high quality implementations with 100% test coverage.
+  - **UPDATE** - Check out [Lago](https://github.com/yangshun/lago), which is a Data Structures and Algorithms library that contains more high-quality implementations with 100% test coverage.
 
 ## Related
 

From 040b7e3dbc613353a068f642c6fa6219ce38200c Mon Sep 17 00:00:00 2001
From: Sam Willis <swillis93@googlemail.com>
Date: Tue, 17 Oct 2017 04:26:16 +0100
Subject: [PATCH 46/71] Added additional HTML and Interview information (#52)

* Add information about HTML

* Add post interview advice

* Update cheatsheet.md
---
 front-end/html.md       | 6 +++++-
 preparing/cheatsheet.md | 7 +++++++
 2 files changed, 12 insertions(+), 1 deletion(-)

diff --git a/front-end/html.md b/front-end/html.md
index 5b1407ae..16bd16c1 100644
--- a/front-end/html.md
+++ b/front-end/html.md
@@ -1,12 +1,16 @@
 HTML
 ==
 
-WIP.
+HTML (Hypertext Markup Language) is the structure that all websites are built on. Anyone working on websites and webapps should have a basic understanding of HTML at the very least. A helpfull analogy for understanding the importance of HTML is the house scenario. When building a new house, the process can be split into a few key areas; strucute (HTML), aesthetics (CSS) and furniture (Content). The HTML is your basic page structure, without the structure, you cannot change how it looks using CSS, or what content is on the page.
 
 ## Glossary
 
 - **Doctype**
 
+## Deprecated Tags
+
+There are a number of tags from past versions of HTML that have become deprecated over time. This means that while they are no longer considered valid elements, most browsers should still be able to read and render them. 
+
 ## Script Loading
 
 - `<script>` - HTML parsing is blocked, the script is fetched and executed immediately, HTML parsing resumes after the script is executed.
diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index 11ab62b0..c12bd180 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -95,6 +95,13 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |⚠️|Ask about your interview performance. It can get awkward.|
 |❌|End the interview without asking any questions.|
 
+### 7. Post Interview
+
+|| Things |
+|-|-|
+|✅|Record the interview questions and answers down as these can be useful for future reference.|
+|⚠️|Send a follow up email to your interviewer(s) thanking them for their time and the opportunity to interview with them.|
+
 ###### References
 
 - [Preparing for a Facebook/Google Software Engineer Interview](https://orrsella.com/2016/05/14/preparing-for-a-facebook-google-software-engineer-interview/)

From 88bc6fdc5ce97d3900395a87d1b758d21f115fec Mon Sep 17 00:00:00 2001
From: Mohamed Oun <mohamed3on@gmail.com>
Date: Tue, 17 Oct 2017 09:54:19 +0200
Subject: [PATCH 47/71] Fix typo in html.md (#54)

* Fix typo in html.md

* Update html.md
---
 front-end/html.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/front-end/html.md b/front-end/html.md
index 16bd16c1..97034e16 100644
--- a/front-end/html.md
+++ b/front-end/html.md
@@ -1,7 +1,7 @@
 HTML
 ==
 
-HTML (Hypertext Markup Language) is the structure that all websites are built on. Anyone working on websites and webapps should have a basic understanding of HTML at the very least. A helpfull analogy for understanding the importance of HTML is the house scenario. When building a new house, the process can be split into a few key areas; strucute (HTML), aesthetics (CSS) and furniture (Content). The HTML is your basic page structure, without the structure, you cannot change how it looks using CSS, or what content is on the page.
+HTML (Hypertext Markup Language) is the structure that all websites are built on. Anyone working on websites and webapps should have a basic understanding of HTML at the very least. A helpful analogy for understanding the importance of HTML is the house scenario. When building a new house, the process can be split into a few key areas; structure (HTML), aesthetics (CSS) and furniture (Content). The HTML is your basic page structure, without the structure, you cannot change how it looks using CSS, or what content is on the page.
 
 ## Glossary
 

From d8c3f984e4c4ad1bfcf5bb1538faa0e29cf0b9fc Mon Sep 17 00:00:00 2001
From: Amir Ariffin <amir.ariffin.920404@gmail.com>
Date: Tue, 17 Oct 2017 18:51:23 +0800
Subject: [PATCH 48/71] Fix grammar issues in DP (#53)

* ran content through grammar checker and break the code example after
column 100 to remove horizontal scroll bar when viewing on GitHub

* Update dynamic-programming.md
---
 algorithms/dynamic-programming.md | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/algorithms/dynamic-programming.md b/algorithms/dynamic-programming.md
index be6979d6..978fa611 100644
--- a/algorithms/dynamic-programming.md
+++ b/algorithms/dynamic-programming.md
@@ -5,8 +5,8 @@ Dynamic Programming
 - Given some coin denominations and a target value `M`, return the coins combination with the minimum number of coins.
   - Time complexity: `O(MN)`, where N is the number of distinct type of coins.
   - Space complexity: `O(M)`.
-- Given a set of numbers in an array which represent number of consecutive days of AirBnb reservation requested, as a host, pick the sequence which maximizes the number of days of occupancy, at the same time, leaving at least a 1 day gap in-between bookings for cleaning.
-  - Problem reduces to finding the maximum sum of non-consecutive array elements.
+- Given a set of numbers in an array which represent a number of consecutive days of Airbnb reservation requested, as a host, pick the sequence which maximizes the number of days of occupancy, at the same time, leaving at least a 1-day gap in-between bookings for cleaning.
+  - The problem reduces to finding the maximum sum of non-consecutive array elements.
   - E.g.
     ~~~
     // [5, 1, 1, 5] => 10
@@ -16,7 +16,8 @@ Dynamic Programming
     // Dec 6 - 7
     // Dec 7 - 12
 
-    The answer would be to pick Dec 1-5 (5 days) and then pick Dec 7-12 for a total of 10 days of occupancy, at the same time, leaving at least 1 day gap for cleaning between reservations.
+    The answer would be to pick Dec 1-5 (5 days) and then pick Dec 7-12 for a total of 10 days of
+    occupancy, at the same time, leaving at least 1-day gap for cleaning between reservations.
 
     Similarly,
     // [3, 6, 4] => 7

From d9b9d4b5ca25e36458ef1282cc9379ffb91e2705 Mon Sep 17 00:00:00 2001
From: Yangshun Tay <tay.yang.shun@gmail.com>
Date: Wed, 18 Oct 2017 17:00:48 +0800
Subject: [PATCH 49/71] Add a ton of JS algo snippets (#56)

---
 utilities/javascript/binToInt.js           | 15 ++++++++++++
 utilities/javascript/binarySearch.js       | 18 +++++++-------
 utilities/javascript/deepEqual.js          |  5 ++--
 utilities/javascript/graphTopoSort.js      |  2 +-
 utilities/javascript/intToBin.js           | 19 +++++++++++++++
 utilities/javascript/intervalsIntersect.js | 17 +++++++++++++
 utilities/javascript/intervalsMerge.js     | 16 +++++++++++++
 utilities/javascript/matrixClone.js        | 18 ++++++++++++++
 utilities/javascript/matrixTranspose.js    | 11 +++++++++
 utilities/javascript/matrixTraverse.js     | 28 ++++++++++++++++++++++
 10 files changed, 136 insertions(+), 13 deletions(-)
 create mode 100644 utilities/javascript/binToInt.js
 create mode 100644 utilities/javascript/intToBin.js
 create mode 100644 utilities/javascript/intervalsIntersect.js
 create mode 100644 utilities/javascript/intervalsMerge.js
 create mode 100644 utilities/javascript/matrixClone.js
 create mode 100644 utilities/javascript/matrixTranspose.js
 create mode 100644 utilities/javascript/matrixTraverse.js

diff --git a/utilities/javascript/binToInt.js b/utilities/javascript/binToInt.js
new file mode 100644
index 00000000..c34a278d
--- /dev/null
+++ b/utilities/javascript/binToInt.js
@@ -0,0 +1,15 @@
+// Does not handle negative binary numbers.
+function binToInt(binary) {
+    let res = 0;
+    for (let i = 0; i < binary.length; i++) {
+        res = res * 2 + (+binary[i]);
+    }
+    return res;
+}
+
+console.log(binToInt('0') === parseInt('0', 2) && parseInt('0', 2) === 0);
+console.log(binToInt('1') === parseInt('1', 2) && parseInt('1', 2) === 1);
+console.log(binToInt('10') === parseInt('10', 2) && parseInt('10', 2) === 2);
+console.log(binToInt('11') === parseInt('11', 2) && parseInt('11', 2) === 3);
+console.log(binToInt('101') === parseInt('101', 2) && parseInt('101', 2) === 5);
+console.log(binToInt('1100011') === parseInt('1100011', 2) && parseInt('1100011', 2) === 99);
diff --git a/utilities/javascript/binarySearch.js b/utilities/javascript/binarySearch.js
index 8a656af0..9ce8b336 100644
--- a/utilities/javascript/binarySearch.js
+++ b/utilities/javascript/binarySearch.js
@@ -15,12 +15,12 @@ function binarySearch(arr, target) {
     return -1;
 }
 
-console.log(binarySearch([1, 2, 3, 10], 1) === 0)
-console.log(binarySearch([1, 2, 3, 10], 2) === 1)
-console.log(binarySearch([1, 2, 3, 10], 3) === 2)
-console.log(binarySearch([1, 2, 3, 10], 10) === 3)
-console.log(binarySearch([1, 2, 3, 10], 9) === -1)
-console.log(binarySearch([1, 2, 3, 10], 4) === -1)
-console.log(binarySearch([1, 2, 3, 10], 0) === -1)
-console.log(binarySearch([1, 2, 3, 10], 11) === -1)
-console.log(binarySearch([5, 7, 8, 10], 3) === -1)
+console.log(binarySearch([1, 2, 3, 10], 1) === 0);
+console.log(binarySearch([1, 2, 3, 10], 2) === 1);
+console.log(binarySearch([1, 2, 3, 10], 3) === 2);
+console.log(binarySearch([1, 2, 3, 10], 10) === 3);
+console.log(binarySearch([1, 2, 3, 10], 9) === -1);
+console.log(binarySearch([1, 2, 3, 10], 4) === -1);
+console.log(binarySearch([1, 2, 3, 10], 0) === -1);
+console.log(binarySearch([1, 2, 3, 10], 11) === -1);
+console.log(binarySearch([5, 7, 8, 10], 3) === -1);
diff --git a/utilities/javascript/deepEqual.js b/utilities/javascript/deepEqual.js
index 78eeb285..ec82255c 100644
--- a/utilities/javascript/deepEqual.js
+++ b/utilities/javascript/deepEqual.js
@@ -17,9 +17,8 @@ function deepEqual(val1, val2) {
     }
 
     // Object comparison.
-    if (typeof val1 === 'object' && typeof val2 === 'object') {
-        const keys1 = Object.keys(val1);
-        const keys2 = Object.keys(val2);
+    if (typeof val1 === 'object' && typeof val2 === 'object' && val1 !== null) {
+        const keys1 = Object.keys(val1), keys2 = Object.keys(val2);
         if (keys1.length !== keys2.length) {
             return false;
         }
diff --git a/utilities/javascript/graphTopoSort.js b/utilities/javascript/graphTopoSort.js
index 12a0903f..13468026 100644
--- a/utilities/javascript/graphTopoSort.js
+++ b/utilities/javascript/graphTopoSort.js
@@ -32,4 +32,4 @@ function graphTopoSort(numberNodes, edges) {
     return order.length == numberNodes ? order : [];
 }
 
-console.log(graphTopoSort(3, [[0, 1], [0, 2]]))
+console.log(graphTopoSort(3, [[0, 1], [0, 2]]));
diff --git a/utilities/javascript/intToBin.js b/utilities/javascript/intToBin.js
new file mode 100644
index 00000000..6d33e7e5
--- /dev/null
+++ b/utilities/javascript/intToBin.js
@@ -0,0 +1,19 @@
+// Does not handle negative numbers.
+function intToBin(number) {
+    if (number === 0) {
+        return '0';
+    }
+    let res = '';
+    while (number > 0) {
+        res = String(number % 2) + res;
+        number = parseInt(number / 2, 10);
+    }
+    return res;
+}
+
+console.log(intToBin(0) === 0..toString(2) && 0..toString(2) === '0');
+console.log(intToBin(1) === 1..toString(2) && 1..toString(2) === '1');
+console.log(intToBin(2) === 2..toString(2) && 2..toString(2) === '10');
+console.log(intToBin(3) === 3..toString(2) && 3..toString(2) === '11');
+console.log(intToBin(5) === 5..toString(2) && 5..toString(2) === '101');
+console.log(intToBin(99) === 99..toString(2) && 99..toString(2) === '1100011');
diff --git a/utilities/javascript/intervalsIntersect.js b/utilities/javascript/intervalsIntersect.js
new file mode 100644
index 00000000..2c6d59a0
--- /dev/null
+++ b/utilities/javascript/intervalsIntersect.js
@@ -0,0 +1,17 @@
+// Interval: [start, end].
+function intervalsIntersect(a, b) {
+    return a[0] < b[1] && b[0] < a[1];
+}
+
+console.log(intervalsIntersect([1, 2], [3, 4]) === false);
+console.log(intervalsIntersect([1, 2], [2, 4]) === false);
+console.log(intervalsIntersect([1, 2], [1, 4]) === true);
+console.log(intervalsIntersect([1, 2], [0, 4]) === true);
+console.log(intervalsIntersect([1, 2], [0, 2]) === true);
+console.log(intervalsIntersect([1, 2], [0, 1.5]) === true);
+console.log(intervalsIntersect([3, 4], [1, 2]) === false);
+console.log(intervalsIntersect([2, 4], [1, 2]) === false);
+console.log(intervalsIntersect([1, 4], [1, 2]) === true);
+console.log(intervalsIntersect([0, 4], [1, 2]) === true);
+console.log(intervalsIntersect([0, 2], [1, 2]) === true);
+console.log(intervalsIntersect([0, 1.5], [1, 2]) === true);
diff --git a/utilities/javascript/intervalsMerge.js b/utilities/javascript/intervalsMerge.js
new file mode 100644
index 00000000..795ca37a
--- /dev/null
+++ b/utilities/javascript/intervalsMerge.js
@@ -0,0 +1,16 @@
+// Interval: [start, end].
+// Merges two overlapping intervals into one.
+function intervalsMerge(a, b) {
+    return [Math.min(a[0], b[0]), Math.max(a[1], b[1])];
+}
+
+const deepEqual = require('./deepEqual');
+
+console.log(deepEqual(intervalsMerge([1, 2], [1, 4]), [1, 4]));
+console.log(deepEqual(intervalsMerge([1, 2], [0, 4]), [0, 4]));
+console.log(deepEqual(intervalsMerge([1, 2], [0, 2]), [0, 2]));
+console.log(deepEqual(intervalsMerge([1, 2], [0, 1.5]), [0, 2]));
+console.log(deepEqual(intervalsMerge([1, 4], [1, 2]), [1, 4]));
+console.log(deepEqual(intervalsMerge([0, 4], [1, 2]), [0, 4]));
+console.log(deepEqual(intervalsMerge([0, 2], [1, 2]), [0, 2]));
+console.log(deepEqual(intervalsMerge([0, 1.5], [1, 2]), [0, 2]));
diff --git a/utilities/javascript/matrixClone.js b/utilities/javascript/matrixClone.js
new file mode 100644
index 00000000..b3f3f996
--- /dev/null
+++ b/utilities/javascript/matrixClone.js
@@ -0,0 +1,18 @@
+function matrixClone(matrix, defaultValue) {
+    return matrix.map(row => {
+        return defaultValue === undefined ? row.slice(0) : Array(row.length).fill(defaultValue);
+    });
+}
+
+const deepEqual = require('./deepEqual');
+
+// Test clone.
+const a = [[1, 2], [1, 4]];
+console.log(deepEqual(matrixClone(a), [[1, 2], [1, 4]]));
+a[0][0] = 4;
+console.log(deepEqual(matrixClone(a), [[1, 2], [1, 4]]) === false);
+console.log(deepEqual(matrixClone([[1]]), [[1]]));
+
+// Test clone with default value.
+console.log(deepEqual(matrixClone([[1, 2], [1, 4]], 1), [[1, 1], [1, 1]]));
+console.log(deepEqual(matrixClone([[1, 2], [1, 4]], null), [[null, null], [null, null]]));
diff --git a/utilities/javascript/matrixTranspose.js b/utilities/javascript/matrixTranspose.js
new file mode 100644
index 00000000..0418a426
--- /dev/null
+++ b/utilities/javascript/matrixTranspose.js
@@ -0,0 +1,11 @@
+function matrixTranspose(matrix) {
+    return matrix[0].map((col, i) => matrix.map(row => row[i]));
+}
+
+const deepEqual = require('./deepEqual');
+
+console.log(deepEqual(matrixTranspose([[1]]), [[1]]));
+console.log(deepEqual(matrixTranspose([[1, 2]]), [[1], [2]]));
+console.log(deepEqual(matrixTranspose([[1, 2], [1, 4]]), [[1, 1], [2, 4]]));
+console.log(deepEqual(matrixTranspose([[1, 2, 3], [4, 5, 6]]), [[1, 4], [2, 5], [3, 6]]));
+
diff --git a/utilities/javascript/matrixTraverse.js b/utilities/javascript/matrixTraverse.js
new file mode 100644
index 00000000..331a24e4
--- /dev/null
+++ b/utilities/javascript/matrixTraverse.js
@@ -0,0 +1,28 @@
+function traverse(matrix) {
+    const DIRECTIONS = [[0, 1], [0, -1], [1, 0], [-1, 0]];
+    const rows = matrix.length, cols = matrix[0].length;
+    const visited = matrix.map(row => Array(row.length).fill(false));
+    function dfs(i, j) {
+        if (visited[i][j]) {
+            return;
+        }
+        visited[i][j] = true;
+        DIRECTIONS.forEach(dir => {
+            const row = i + dir[0], col = j + dir[1];
+            // Boundary check.
+            if (row < 0 || row >= rows || col < 0 || col >= cols) {
+                return;
+            }
+            // Valid neighbor check.
+            if (matrix[row][col] !== 1) {
+                return;
+            }
+            dfs(row, col);
+        });
+    }
+    for (let i = 0; i < rows; i++) {
+        for (let j = 0; j < cols; j++) {
+            dfs(i, j);
+        }
+    }
+}

From df1c15de0564f81a3c08d686f86b903efb7887f1 Mon Sep 17 00:00:00 2001
From: Jorge Gonzalez <jorgegonzalez@users.noreply.github.com>
Date: Wed, 18 Oct 2017 10:25:39 -0400
Subject: [PATCH 50/71] Add two-stack-queue problem (#57)

---
 algorithms/queue.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/algorithms/queue.md b/algorithms/queue.md
index 7710f991..31612de9 100644
--- a/algorithms/queue.md
+++ b/algorithms/queue.md
@@ -2,3 +2,4 @@ Queue
 ==
 
 - Implement a Queue class from scratch with an existing bug, the bug is that it cannot take more than 5 elements.
+- Implement a Queue using two stacks. You may only use the standard `push()`, `pop()`, and `peek()` operations traditionally available to stacks. You do not need to implement the stack yourself (i.e. an array can be used to simulate a stack).

From 5d9002d7865c9efe2f8abd9c6a36432934bdf400 Mon Sep 17 00:00:00 2001
From: rishabhjain1996 <rishabh146471@st.jmi.ac.in>
Date: Wed, 18 Oct 2017 20:56:24 +0530
Subject: [PATCH 51/71] Update stack.md (#58)

* Update stack.md

* Update stack.md
---
 algorithms/stack.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/algorithms/stack.md b/algorithms/stack.md
index 627ee2c6..063e3a64 100644
--- a/algorithms/stack.md
+++ b/algorithms/stack.md
@@ -6,3 +6,4 @@ Stack
 - Write an algorithm to determine if all of the delimiters in an expression are matched and closed.
   - E.g. `{ac[bb]}`, `[dklf(df(kl))d]{}` and `{[[[]]]}` are matched. But `{3234[fd` and `{df][d}` are not.
   - [Source](http://blog.gainlo.co/index.php/2016/09/30/uber-interview-question-delimiter-matching/)
+- Sort a stack in ascending order using an additional stack.

From 7154f2ca8e4e6448836a9d43f5a76946c3336c6f Mon Sep 17 00:00:00 2001
From: Mikun Pham <pmquan93@yahoo.com>
Date: Thu, 19 Oct 2017 12:13:49 +0700
Subject: [PATCH 52/71] Fix js highlight (#59)

---
 front-end/interview-questions.md | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index 9630684c..97d30471 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -713,7 +713,7 @@ A closure is the combination of a function and the lexical environment within wh
 
 They can be used in IIFEs to encapsulate some code within a local scope so that variables declared in it do not leak to the global scope.
 
-```
+```js
 (function() {
   // Some code here.
 })();
@@ -721,7 +721,7 @@ They can be used in IIFEs to encapsulate some code within a local scope so that
 
 As a callback that is used once and does not need to be used anywhere else. The code will seem more self-contained and readable when handlers are defined right inside the code calling them, rather than having to search elsewhere to find the function body.
 
-```
+```js
 setTimeout(function () {
   console.log('Hello world!');
 }, 1000);
@@ -729,7 +729,7 @@ setTimeout(function () {
 
 Arguments to functional programming constructs or Lodash (similar to callbacks).
 
-```
+```js
 const arr = [1, 2, 3];
 const double = arr.map(function (el) {
   return el * 2;
@@ -923,7 +923,7 @@ These days, [CORS](http://en.wikipedia.org/wiki/Cross-origin_resource_sharing) i
 
 Yes. Handlebars, Underscore, Lodash, AngularJS and JSX. I disliked templating in AngularJS because it made heavy use of strings in the directives and typos would go uncaught. JSX is my new favourite as it is closer to JavaScript and there is barely and syntax to be learnt. Nowadays, you can even use ES2015 template string literals as a quick way for creating templates without relying on third-party code.
 
-```
+```js
 const template = `<div>My name is: ${name}</div>`;
 ```
 
@@ -933,7 +933,7 @@ However, do beware of a potential XSS in the above approach as the contents are
 
 Hoisting is a term used to explain the behavior of variable declarations in your code. Variables declared or initialized with the `var` keyword will have their declaration "hoisted" up to the top of the current scope. However, only the declaration is hoisted, the assignment (if there is one), will stay where it is. Let's explain with a few examples.
 
-```
+```js
 // var declarations are hoisted.
 console.log(foo); // undefined
 var foo = 1;
@@ -947,7 +947,7 @@ console.log(bar); // 2
 
 Function declarations have the body hoisted while the function expressions (written in the form of variable declarations) only has the variable declaration hoisted.
 
-```
+```js
 // Function Declaration
 console.log(foo); // [Function: foo]
 foo(); // 'FOOOOO'
@@ -973,7 +973,7 @@ When an event triggers on a DOM element, it will attempt to handle the event if
 
 Attributes are defined on the HTML markup but properties are defined on the DOM. To illustrate the difference, imagine we have this text field in our HTML: `<input type="text" value="Hello">`.
 
-```
+```js
 const input = document.querySelector('input');
 console.log(input.getAttribute('value')); // Hello
 console.log(input.value); // Hello
@@ -981,7 +981,7 @@ console.log(input.value); // Hello
 
 But after you change the value of the text field by adding "World!" to it, this becomes:
 
-```
+```js
 console.log(input.getAttribute('value')); // Hello
 console.log(input.value); // Hello World!
 ```

From 4bb406a7de54ec717809b23f3af3aeebc298d90a Mon Sep 17 00:00:00 2001
From: Yes Man <suman.gopalrao@gmail.com>
Date: Wed, 18 Oct 2017 22:49:13 -0700
Subject: [PATCH 53/71] Removed the in jsonp answer. (#60)

---
 front-end/interview-questions.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index 97d30471..8b6c44e4 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -891,7 +891,7 @@ The `XMLHttpRequest` API is frequently used for the asynchronous communication o
 
 JSONP (JSON with Padding) is a method commonly used to bypass the cross-domain policies in web browsers because Ajax requests from the current page to a cross-origin domain is not allowed.
 
-JSONP works by making a request to a cross-origin domain via a `<script>` tag and usually with a `callback` query parameter, for example: `https://example.com?callback=printData`. The server will then wrap the data within the a function called `printData` and return it to the client.
+JSONP works by making a request to a cross-origin domain via a `<script>` tag and usually with a `callback` query parameter, for example: `https://example.com?callback=printData`. The server will then wrap the data within a function called `printData` and return it to the client.
 
 ```html
 <!-- https://mydomain.com -->

From 752356acb4a51be95f65aa4b670e5a71738a4eb2 Mon Sep 17 00:00:00 2001
From: louietyj <louietyj@gmail.com>
Date: Fri, 20 Oct 2017 04:58:44 +0800
Subject: [PATCH 54/71] Add bisect_left and bisect_right (#63)

* Add bisect_left and bisect_right

* Test cases for bisect_left and bisect_right
---
 utilities/python/binary_search.py | 47 +++++++++++++++++++++++++++++++
 1 file changed, 47 insertions(+)

diff --git a/utilities/python/binary_search.py b/utilities/python/binary_search.py
index f9b7d256..4e664c72 100644
--- a/utilities/python/binary_search.py
+++ b/utilities/python/binary_search.py
@@ -11,6 +11,32 @@ def binary_search(arr, target):
             right = mid - 1
     return -1
 
+def bisect_left(arr, target):
+    """Returns the leftmost position that `target` should
+    go to such that the sequence remains sorted."""
+    left = 0
+    right = len(arr)
+    while left < right:
+        mid = (left + right) // 2
+        if arr[mid] < target:
+            left = mid + 1
+        else:
+            right = mid
+    return left
+
+def bisect_right(arr, target):
+    """Returns the rightmost position that `target` should
+    go to such that the sequence remains sorted."""
+    left = 0
+    right = len(arr)
+    while left < right:
+        mid = (left + right) // 2
+        if arr[mid] > target:
+            right = mid
+        else:
+            left = mid + 1
+    return left
+
 print(binary_search([1, 2, 3, 10], 1) == 0)
 print(binary_search([1, 2, 3, 10], 2) == 1)
 print(binary_search([1, 2, 3, 10], 3) == 2)
@@ -20,3 +46,24 @@ print(binary_search([1, 2, 3, 10], 4) == -1)
 print(binary_search([1, 2, 3, 10], 0) == -1)
 print(binary_search([1, 2, 3, 10], 11) == -1)
 print(binary_search([5, 7, 8, 10], 3) == -1)
+
+print(bisect_left([1, 2, 3, 3, 10], 1) == 0)
+print(bisect_left([1, 2, 3, 3, 10], 2) == 1)
+print(bisect_left([1, 2, 3, 3, 10], 3) == 2) # First "3" is at index 2
+print(bisect_left([1, 2, 3, 3, 10], 10) == 4)
+
+# These return a valid index despite target not being in array.
+print(bisect_left([1, 2, 3, 3, 10], 9) == 4)
+print(bisect_left([1, 2, 3, 3, 10], 0) == 0) # Insert "0" at front
+print(bisect_left([1, 2, 3, 3, 10], 11) == 5) # Insert "5" at back
+
+print(bisect_right([1, 2, 3, 3, 10], 1) == 1)
+print(bisect_right([1, 2, 3, 3, 10], 2) == 2)
+print(bisect_right([1, 2, 3, 3, 10], 3) == 4) # Last "3" is at index 3, so insert new "3" at index 4
+print(bisect_right([1, 2, 3, 3, 10], 10) == 5)
+
+# These return a valid index despite target not being in array.
+print(bisect_right([1, 2, 3, 3, 10], 9) == 4)
+print(bisect_right([1, 2, 3, 3, 10], 0) == 0) # Insert "0" at front
+print(bisect_right([1, 2, 3, 3, 10], 11) == 5) # Insert "5" at back
+

From a3af358c3f287af4410831df9ac1c652685b4122 Mon Sep 17 00:00:00 2001
From: louietyj <louietyj@gmail.com>
Date: Fri, 20 Oct 2017 17:28:17 +0800
Subject: [PATCH 55/71] Add Rabin-Karp rolling hash (#64)

* Rabin-Karp hash implementation

* Test cases for Rabin-Karp hash
---
 utilities/python/rabin_karp_hash.py | 41 +++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 utilities/python/rabin_karp_hash.py

diff --git a/utilities/python/rabin_karp_hash.py b/utilities/python/rabin_karp_hash.py
new file mode 100644
index 00000000..9f0fd105
--- /dev/null
+++ b/utilities/python/rabin_karp_hash.py
@@ -0,0 +1,41 @@
+## Rabin-Karp Rolling Hash
+## Implementation of: https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm#Hash_function_used
+##
+## This rolling hash function is useful when you need to compute the hash of successive substrings
+## of text. E.g. note that going from 'abcd' to 'bcde', we drop the 'a' from the back and add an 'e'
+## on the right. The rolling hash function thus allows us to update the hash in-place O(1) instead of
+## recomputing the full hash of the substring O(m), where m is the length of the substring.
+##
+## NOTE: The implementation below takes in a tuple of integers, to be as general as possible. For use
+## with strings, simply take the ASCII value of each character before passing into the functions.
+
+BASE = 101  # Arbitrary prime number
+
+def rk_hash_init(tpl):
+    '''Initializes the hash with a tuple of integers.'''
+    return sum(n * BASE ** i for i, n in enumerate(reversed(tpl)))
+
+def rk_hash_update(curr_hash, size, add_n, rem_n):
+    '''Updates the hash by removing an integer from the left and appending
+    an integer to the right.
+
+    curr_hash: The previous hash
+    size: The size of the rolling window
+    add_n: The integer appended to the right
+    rem_n: The integer removed from the left'''
+    return (curr_hash - (rem_n * BASE ** (size - 1))) * BASE + add_n
+
+
+
+abc_hash = rk_hash_init(tuple(map(ord, 'abc')))     # Init the hash with 'abc'
+print('abc:', abc_hash)
+bcd_hash_1 = rk_hash_update(abc_hash, 3, ord('d'), ord('a'))    # Add a 'd' to the right, remove an 'a' from the left
+print('bcd 1:', bcd_hash_1)
+
+zbc_hash = rk_hash_init(tuple(map(ord, 'zbc')))     # Init the hash with 'zbc'
+print('zbc:', zbc_hash)
+bcd_hash_2 = rk_hash_update(zbc_hash, 3, ord('d'), ord('z'))    # Add a 'd' to the right, remove a 'z' from the left
+print('bcd 2:', bcd_hash_2)
+
+# Notice that both hash values are the same despite arriving via different paths
+print(bcd_hash_1 == bcd_hash_2)

From 856b1e611e2bfe45745a34612dc93a6e881b7ab3 Mon Sep 17 00:00:00 2001
From: louietyj <louietyj@gmail.com>
Date: Fri, 20 Oct 2017 17:28:40 +0800
Subject: [PATCH 56/71] Add Union-Find data structure (#65)

* Union-Find implementation

* Example usage
---
 utilities/python/union_find.py | 50 ++++++++++++++++++++++++++++++++++
 1 file changed, 50 insertions(+)
 create mode 100644 utilities/python/union_find.py

diff --git a/utilities/python/union_find.py b/utilities/python/union_find.py
new file mode 100644
index 00000000..e2f0427d
--- /dev/null
+++ b/utilities/python/union_find.py
@@ -0,0 +1,50 @@
+## Union-Find data structure
+## https://en.wikipedia.org/wiki/Disjoint-set_data_structure
+
+parents = [0, 1, 2, 3, 4, 5, 6] # parent[i] is the parent of i
+weights = [1, 1, 1, 1, 1, 1, 1]
+
+def find_root(parents, p):
+    '''Average: O(log n)'''
+    root = p
+    while parents[root] != root:
+        root = parents[root]
+    # Flatten tree
+    while parents[p] != p:
+        parents[p], p = root, parents[p]
+    return root
+
+def union(parents, p, q):
+    '''Average: O(log n)'''
+    p = find_root(parents, p)
+    q = find_root(parents, q)
+    # Link the smaller node to the larger node
+    if weights[p] > weights[q]:
+        parents[q] = p
+        weights[p] += weights[q]
+    else:
+        parents[p] = q
+        weights[q] += weights[p]
+
+
+
+# Start with all elements separate
+# -> [0], [1], [2], [3], [4], [5], [6]
+print(find_root(parents, 2) == 2)
+
+# Merge 1, 2, 3 and 4, 5, 6
+# -> [0], [1, 2, 3], [4, 5, 6]
+union(parents, 1, 2)
+union(parents, 2, 3)
+union(parents, 4, 5)
+union(parents, 4, 6)
+
+# Roots of 1, 2, 3 and 4, 5, 6 are the same
+print(find_root(parents, 0))
+print(list(find_root(parents, i) for i in (1, 2, 3)))
+print(list(find_root(parents, i) for i in (4, 5, 6)))
+
+# Merge 2, 4
+# -> [0], [1, 2, 3, 4, 5, 6]
+union(parents, 2, 4)
+print(list(find_root(parents, i) for i in (1, 2, 3, 4, 5, 6)))

From 4c672de8e6b32925b692670898d81efcd20bff48 Mon Sep 17 00:00:00 2001
From: louietyj <louietyj@gmail.com>
Date: Fri, 20 Oct 2017 17:29:28 +0800
Subject: [PATCH 57/71] Add QuickSelect algorithm (#66)

* QuickSelect implementation

* QuickSelect tests
---
 utilities/python/quick_select.py | 60 ++++++++++++++++++++++++++++++++
 1 file changed, 60 insertions(+)
 create mode 100644 utilities/python/quick_select.py

diff --git a/utilities/python/quick_select.py b/utilities/python/quick_select.py
new file mode 100644
index 00000000..c121d0d4
--- /dev/null
+++ b/utilities/python/quick_select.py
@@ -0,0 +1,60 @@
+## QuickSelect -- Linear-time k-th order statistic
+## (i.e. select the k-th smallest element in an unsorted array)
+## https://en.wikipedia.org/wiki/Quickselect
+
+def partition(array, start, end, pivot):
+    """Partitions by a pivot value, which might not necessarily be in the array.
+    This variant is useful when you want to bound your recursion depth by the
+    range of the input values, and not the length of the array."""
+    pivot_index = start
+    for i in range(start, end):
+        if array[i] <= pivot:
+            array[i], array[pivot_index] = array[pivot_index], array[i]
+            pivot_index += 1
+    return pivot_index
+
+import random
+def partition_first(array, start, end):
+    """Selects the first element as pivot. Returns the index where the pivot went to.
+    In this variant, we can guarantee that the pivot will be in its final sorted position.
+    We need this guarantee for QuickSelect."""
+    if start + 1 == end:
+        return start
+    pivot = array[start]
+    pivot_index = start + 1
+    for i in range(start + 1, end):
+        if array[i] <= pivot:
+            array[i], array[pivot_index] = array[pivot_index], array[i]
+            pivot_index += 1
+    # Move pivot to front
+    array[start], array[pivot_index - 1] = array[pivot_index - 1], array[start]
+    return pivot_index - 1
+
+def quick_select(array, k):
+    """NOTE: k-th smallest element counts from 0!"""
+    left = 0
+    right = len(array)
+    while True:
+        random_index = random.sample(range(left, right), 1)[0]
+        array[left], array[random_index] = array[random_index], array[left]
+        pivot_index = partition_first(array, left, right)
+        if k == pivot_index:
+            return array[pivot_index]
+        if k < pivot_index:
+            right = pivot_index
+        else:
+            left = pivot_index + 1
+
+
+
+print(quick_select([0], 0) == 0)
+print(quick_select([0, 1, 2, 3, 4], 2) == 2)
+print(quick_select([4, 3, 2, 1, 0], 2) == 2)
+print(quick_select([1, 3, 4, 2, 0], 2) == 2)
+
+# Large test case, for randomized tests
+lst = list(range(1000))
+for _ in range(10):
+    k = random.randint(0, 999)
+    random.shuffle(lst)
+    print(quick_select(lst, k) == k)

From 25dc9663ad90861a3de2e1f08502124ab5fca8b3 Mon Sep 17 00:00:00 2001
From: louietyj <louietyj@gmail.com>
Date: Sat, 21 Oct 2017 01:20:43 +0800
Subject: [PATCH 58/71] Add min-heap (#68)

* Min-heap implementation

* Heap test cases
---
 utilities/python/heap.py | 84 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 84 insertions(+)
 create mode 100644 utilities/python/heap.py

diff --git a/utilities/python/heap.py b/utilities/python/heap.py
new file mode 100644
index 00000000..4bbb926f
--- /dev/null
+++ b/utilities/python/heap.py
@@ -0,0 +1,84 @@
+# Implements a min-heap. For max-heap, simply reverse all comparison orders.
+#
+# Note on alternate subroutine namings (used in some textbooks):
+#     - _bubble_up = siftdown
+#     - _bubble_down = siftup
+
+def _bubble_up(heap, i):
+    while i > 0:
+        parent_i = (i - 1) // 2
+        if heap[i] < heap[parent_i]:
+            heap[i], heap[parent_i] = heap[parent_i], heap[i]
+            i = parent_i
+            continue
+        break
+
+def _bubble_down(heap, i):
+    startpos = i
+    newitem = heap[i]
+    left_i = 2 * i + 1
+    while left_i < len(heap):
+        # Pick the smaller of the L and R children
+        right_i = left_i + 1
+        if right_i < len(heap) and not heap[left_i] < heap[right_i]:
+            child_i = right_i
+        else:
+            child_i = left_i
+
+        # Break if heap invariant satisfied
+        if heap[i] < heap[child_i]:
+            break
+        
+        # Move the smaller child up.
+        heap[i], heap[child_i] = heap[child_i], heap[i]
+        i = child_i
+        left_i = 2 * i + 1
+
+def heapify(lst):
+    for i in reversed(range(len(lst) // 2)):
+        _bubble_down(lst, i)
+
+def heappush(heap, item):
+    heap.append(item)
+    _bubble_up(heap, len(heap) - 1)
+
+def heappop(heap):
+    if len(heap) == 1:
+        return heap.pop()
+    min_value = heap[0]
+    heap[0] = heap[-1]
+    del heap[-1]
+    _bubble_down(heap, 0)
+    return min_value
+
+
+
+# Example usage
+heap = [3, 2, 1, 0]
+heapify(heap)
+print('Heap(0, 1, 2, 3):', heap)
+heappush(heap, 4)
+heappush(heap, 7)
+heappush(heap, 6)
+heappush(heap, 5)
+print('Heap(0, 1, 2, 3, 4, 5, 6, 7):', heap)
+
+sorted_list = [heappop(heap) for _ in range(8)]
+print('Heap-sorted list:', sorted_list)
+
+# Large test case, for randomized tests
+import random
+
+# Heapify 0 ~ 99
+heap = list(range(100))
+random.shuffle(heap)
+heapify(heap)
+
+# Push 100 ~ 199 in random order
+new_elems = list(range(100, 200))
+random.shuffle(new_elems)
+for elem in new_elems:
+    heappush(heap, elem)
+
+sorted_list = [heappop(heap) for _ in range(200)]
+print(sorted_list == sorted(sorted_list))

From d522c4cceb5bf6fafffb569875b140b4ae570eee Mon Sep 17 00:00:00 2001
From: Bingxu Ren <bingxuren@users.noreply.github.com>
Date: Fri, 20 Oct 2017 12:21:40 -0500
Subject: [PATCH 59/71] Add some OOP questions (#67)

* added some oop questions

* Update oop.md
---
 algorithms/oop.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/algorithms/oop.md b/algorithms/oop.md
index 54c32a4c..0df9cc2d 100644
--- a/algorithms/oop.md
+++ b/algorithms/oop.md
@@ -2,3 +2,7 @@ Object-Oriented Programming
 ==
 
 - How would you design a chess game? What classes and objects would you use? What methods would they have?
+- How would you design the data structures for a book keeping system for a library?
+- Explain how you would design a HTTP server? Give examples of classes, methods, and interfaces. What are the challenges here?
+- Discuss algorithms and data structures for a garbage collector?
+- How would you implement an HR system to keep track of employee salaries and benefits?

From 97d3d4d7f4bd3330be93326db27d2ffe8f565da5 Mon Sep 17 00:00:00 2001
From: Brandon <3676319+sibeitokgong@users.noreply.github.com>
Date: Sat, 21 Oct 2017 01:42:16 +0800
Subject: [PATCH 60/71] Remove link with SSL error (#70)

---
 preparing/cheatsheet.md | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index c12bd180..c750f0ff 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -101,7 +101,3 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |-|-|
 |✅|Record the interview questions and answers down as these can be useful for future reference.|
 |⚠️|Send a follow up email to your interviewer(s) thanking them for their time and the opportunity to interview with them.|
-
-###### References
-
-- [Preparing for a Facebook/Google Software Engineer Interview](https://orrsella.com/2016/05/14/preparing-for-a-facebook-google-software-engineer-interview/)

From c16c7fcf4720fddd35fa3184695a69ddbbc81d01 Mon Sep 17 00:00:00 2001
From: Brandon <3676319+sibeitokgong@users.noreply.github.com>
Date: Sat, 21 Oct 2017 01:42:29 +0800
Subject: [PATCH 61/71] Remove broken link in front-end/design (#69)

---
 front-end/design.md | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/front-end/design.md b/front-end/design.md
index 38b58ef2..cef9c972 100644
--- a/front-end/design.md
+++ b/front-end/design.md
@@ -12,7 +12,3 @@ Talk me through a full stack implementation of an autocomplete widget. A user ca
 - What does the backend API look like?
 - What perf considerations are there for complete-as-you-type behavior? Are there any edge cases (for example, if the user types fast and the network is slow)?
 - How would you design the network stack and backend in support of fast performance: how do your client/server communicate? How is your data stored on the backend? How do these approaches scale to lots of data and lots of clients?
-
-###### References
-
-- https://performancejs.com/post/hde6d32/The-Best-Frontend-JavaScript-Interview-Questions-%28written-by-a-Frontend-Engineer%29

From 5c43799e5700fd2891b1c6ee21716f8c473bb5ef Mon Sep 17 00:00:00 2001
From: Bingxu Ren <bingxuren@users.noreply.github.com>
Date: Fri, 20 Oct 2017 21:38:34 -0500
Subject: [PATCH 62/71] Add bit manipulation questions  (#72)

---
 algorithms/bit-manipulation.md | 7 +++++++
 1 file changed, 7 insertions(+)
 create mode 100644 algorithms/bit-manipulation.md

diff --git a/algorithms/bit-manipulation.md b/algorithms/bit-manipulation.md
new file mode 100644
index 00000000..5ad2f2c4
--- /dev/null
+++ b/algorithms/bit-manipulation.md
@@ -0,0 +1,7 @@
+Bit Manipulation
+==
+
+- How do you verify if an interger is a power of 2?
+- Wirte a program to print the binary representation of an integer.
+- Write a program to print out the number of 1 bits in a given integer.
+- Write a program to determine the largest possible integer using the same number of 1 bits in a given number.
\ No newline at end of file

From 26db82fd8560d54b1f385814b8871e6fba42fa91 Mon Sep 17 00:00:00 2001
From: louietyj <louietyj@gmail.com>
Date: Sat, 21 Oct 2017 10:39:55 +0800
Subject: [PATCH 63/71] Add Linked List (#71)

* LinkedList implementation

* LinkedList lazy iterator

* LinkedList example usage
---
 utilities/python/linked_list.py | 109 ++++++++++++++++++++++++++++++++
 1 file changed, 109 insertions(+)
 create mode 100644 utilities/python/linked_list.py

diff --git a/utilities/python/linked_list.py b/utilities/python/linked_list.py
new file mode 100644
index 00000000..af0a7eb9
--- /dev/null
+++ b/utilities/python/linked_list.py
@@ -0,0 +1,109 @@
+# Singly-Linked List
+#
+# The linked list is passed around as a variable pointing to the
+# root node of the linked list, or None if the list is empty.
+
+class LinkedListNode:
+    def __init__(self, value):
+        self.value = value
+        self.next = None
+
+def linked_list_append(linked_list, value):
+    '''Appends a value to the end of the linked list'''
+    node = linked_list
+    insert_node = LinkedListNode(value)
+    if not node:
+        return insert_node
+    while node.next:
+        node = node.next
+    node.next = insert_node
+    return linked_list
+
+def linked_list_insert_index(linked_list, value, index):
+    '''Inserts a value at a particular index'''
+    node = linked_list
+    insert_node = LinkedListNode(value)
+    
+    # Check if inserting at head
+    if index == 0:
+        insert_node.next = node
+        return insert_node
+
+    # Skip ahead
+    for _ in range(index - 1):
+        node = node.next
+        if not node:
+            raise ValueError
+    insert_node.next = node.next
+    node.next = insert_node
+    return linked_list
+
+def linked_list_delete(linked_list, value):
+    '''Deletes the first occurrence of a value in the linked list'''
+    node = linked_list
+    
+    # Check if deleting at head
+    if node.value == value:
+        return node.next
+
+    # Skip ahead
+    while node.next:
+        if node.next.value == value:
+            node.next = node.next.next
+            return linked_list
+        node = node.next
+    raise ValueError
+
+def linked_list_delete_index(linked_list, index):
+    '''Deletes the element at a particular index in the linked list'''
+    node = linked_list
+    
+    # Check if deleting at head
+    if index == 0:
+        return node.next
+
+    # Skip ahead
+    for _ in range(index - 1):
+        node = node.next
+        if not node:
+            raise ValueError
+    if not node.next:
+        raise ValueError
+    node.next = node.next.next
+    return linked_list
+
+def linked_list_iter(linked_list):
+    '''Lazy iterator over each node in the linked list'''
+    node = linked_list
+    while node is not None:
+        yield node
+        node = node.next
+
+
+# Append to back
+linked_list = None    # Start with an empty linked list
+linked_list = linked_list_append(linked_list, 1)
+linked_list = linked_list_append(linked_list, 2)
+linked_list = linked_list_append(linked_list, 4)
+print([node.value for node in linked_list_iter(linked_list)])
+
+# Insert by index
+linked_list = linked_list_insert_index(linked_list, 0, 0) # Front
+print([node.value for node in linked_list_iter(linked_list)])
+linked_list = linked_list_insert_index(linked_list, 3, 3) # Back
+print([node.value for node in linked_list_iter(linked_list)])
+
+# Delete "3"
+linked_list = linked_list_delete(linked_list, 3)
+print([node.value for node in linked_list_iter(linked_list)])
+
+# Delete by index
+linked_list = linked_list_delete_index(linked_list, 0)
+print([node.value for node in linked_list_iter(linked_list)])
+linked_list = linked_list_delete_index(linked_list, 1)
+print([node.value for node in linked_list_iter(linked_list)])
+
+# Delete until empty
+linked_list = linked_list_delete_index(linked_list, 0)
+linked_list = linked_list_delete_index(linked_list, 0)
+print([node.value for node in linked_list_iter(linked_list)])

From 979a49b82712980d85e405a300ec0eb3d42babe4 Mon Sep 17 00:00:00 2001
From: jkling38 <jkling38@users.noreply.github.com>
Date: Sat, 21 Oct 2017 01:42:06 -0500
Subject: [PATCH 64/71] Starting interviewer docs #55 (#73)

* Starting interviewer docs #55

* Update basics.md
---
 interviewers/basics.md | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 interviewers/basics.md

diff --git a/interviewers/basics.md b/interviewers/basics.md
new file mode 100644
index 00000000..a803e1b6
--- /dev/null
+++ b/interviewers/basics.md
@@ -0,0 +1,20 @@
+Basics
+==
+
+## Disclaimer
+
+These items will all change based on your specific company and needs but these items area starting point.
+
+## Items To Consider
+
+- **Timeliness** - The interviewee should show up on time, but of course things happen and we must all be understanding that things outside of their control may happen. Try to give a few minutes leeway.
+- **Strengths** - Ask the interviewee what they would consider to be their strengths and maybe rate themselves. This gives you a good idea where to start asking technical questions and sets a baseline for expected knowledge of each subject.
+- **Keep Things Loose** - This is of course dependent on your industry but try to keep make the interviewee comfortable. Many people get nervous when trying to perform at their best for others and a technical interview is no different. A suggestion is to start with a personal question such as "What are some of your hobbies?" or "What do you like to do for fun?" These types of questions can help relax an interviewee and allows them to perform better.
+- **Understand The Position** - Understand that a junior level candidate isn't going to have as much knowledge about languages and frameworks as a senior candidate will.
+- **Save Time For Questions** - The interviewee may have questions for you! Give them the ability to ask. Maybe offer up a few questions if they have none, (ie. "What is the typical day here like for my position?", "What is your favorite part about working at __?")
+
+## Tech Question Technique
+
+- **Tools** - Using a text editor such as Sublime or Atom will give the interviewee syntax highlighting but doesn't show compiler errors which can be a help.
+- **Nitpicking** - Sometimes psuedocode is okay. If testing in C# do you really need the interviewee to write `Console.WriteLine()` or is `Print()` good enough?
+-**Keep Dialog Open** - Don't leave the interviewee alone or sit quietly by as they attempt to coe. Give some subtle hints like "I see you're doing ____, can you think of any other ways to accomplish this?" It's unlikely that the interviewee will be working in a silo should they get the job, is there any reason they should be during the interview?

From fb6b426832737821f4333dcfcc8173e8e2a674bf Mon Sep 17 00:00:00 2001
From: Alex Prut <mail@alexprut.com>
Date: Mon, 23 Oct 2017 18:59:21 +0200
Subject: [PATCH 65/71] Added official w3c spec reference to question: 
 attributes in HTML questions (#74)

---
 front-end/interview-questions.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index 8b6c44e4..fd0ec995 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -99,6 +99,7 @@ These days, using `data-` attributes is not encouraged. One reason is that users
 ###### References
 
 - http://html5doctor.com/html5-custom-data-attributes/
+- https://www.w3.org/TR/html5/dom.html#embedding-custom-non-visible-data-with-the-data-*-attributes
 
 ### Consider HTML5 as an open web platform. What are the building blocks of HTML5?
 

From e9e4a3a1249ac6f17f290871b2e33c6e2065ae17 Mon Sep 17 00:00:00 2001
From: doraemonx <33069819+doraemonx@users.noreply.github.com>
Date: Wed, 25 Oct 2017 08:30:04 +0800
Subject: [PATCH 66/71] Fix grammar (#77)

---
 algorithms/string.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/algorithms/string.md b/algorithms/string.md
index a6dc8e7d..247aea05 100644
--- a/algorithms/string.md
+++ b/algorithms/string.md
@@ -4,7 +4,7 @@ String
 - Output list of strings representing a page of hostings given a list of CSV strings.
 - Given a list of words, find the word pairs that when concatenated form a palindrome.
 - Find the most efficient way to identify what character is out of place in a non-palindrome.
-- Implement a simple regex parser which, given a string and a pattern, returns a boolean indicating whether the input matches the pattern. By simple, we mean that the regex can only contain special character: `*` (star), `.` (dot), `+` (plus). The star means that there will be zero or more of previous character in that place in the pattern. The dot means any character for that position. The plus means one or more of previous character in that place in the pattern.
+- Implement a simple regex parser which, given a string and a pattern, returns a boolean indicating whether the input matches the pattern. By simple, we mean that the regex can only contain the following special characters: `*` (star), `.` (dot), `+` (plus). The star means that there will be zero or more of the previous character in that place in the pattern. The dot means any character for that position. The plus means one or more of previous character in that place in the pattern.
 - Find all words from a dictionary that are x edit distance away.
 - Given a string IP and number n, print all CIDR addresses that cover that range.
 - Write a function called `eval`, which takes a string and returns a boolean. This string is allowed 6 different characters: `0`, `1`, `&`, `|`, `(`, and `)`. `eval` should evaluate the string as a boolean expression, where `0` is `false`, `1` is `true`, `&` is an `and`, and `|` is an `or`.

From a5da8b80d50a8051ed2bcf4074c331752574ed02 Mon Sep 17 00:00:00 2001
From: doraemonx <33069819+doraemonx@users.noreply.github.com>
Date: Wed, 25 Oct 2017 11:59:03 +0800
Subject: [PATCH 67/71] Fix grammar (#76)

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 5735622b..a63fddab 100644
--- a/README.md
+++ b/README.md
@@ -32,7 +32,7 @@ This repository has *practical* content that covers all phases of a technical in
 
 ## Who is this for?
 
-Anybody who wants to land a job at a tech company but is new to technical interviews, seasoned engineers who have not been on the other side of the interviewing table in a while and wants to get back into the game, or anyone who wants to be better at technical interviewing.
+Anybody who wants to land a job at a tech company but is new to technical interviews, seasoned engineers who have not been on the other side of the interviewing table in a while and want to get back into the game, or anyone who wants to be better at technical interviewing.
 
 ## How is this repository different?
 

From df43d846dded28a7de32ec4a75043041f5f50113 Mon Sep 17 00:00:00 2001
From: Alex Prut <mail@alexprut.com>
Date: Thu, 26 Oct 2017 15:22:15 +0200
Subject: [PATCH 68/71] Added Reference to CSS quesitons (#79)

* Added reference to CSS question: What is the difference between classes and IDs in CSS?

* Added reference to CSS question: Explain CSS sprites...

* Update interview-questions.md
---
 front-end/interview-questions.md | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index fd0ec995..47d8f7fc 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -200,6 +200,10 @@ Answers to [Front-end Job Interview Questions - CSS Questions](https://github.co
 - **IDs** - Meant to be unique within the document. Can be used to identify an element when linking using a fragment identifier. Elements can only have one `id` attribute.
 - **Classes** - Can be reused on multiple elements within the document. Mainly for styling and targeting elements.
 
+###### References
+- https://www.w3.org/TR/CSS1/#id-as-selector
+- https://www.w3.org/TR/CSS1/#class-as-selector
+
 ### What's the difference between "resetting" and "normalizing" CSS? Which would you choose, and why?
 
 - **Resetting** - Resetting is meant to strip all default browser styling on elements. For e.g. `margin`s, `padding`s, `font-size`s of all elements are reset to be the same. You will have to redeclare styling for common typographic elements.
@@ -294,6 +298,10 @@ CSS sprites combine multiple images into one single larger image. It is commonly
 - Reduce the number of HTTP requests for multiple images (only one single request is required per spritesheet). But with HTTP2, loading multiple images is no longer much of an issue.
 - Advance downloading of assets that won't be downloaded until needed, such as images that only appear upon `:hover` pseudo-states. Blinking wouldn't be seen.
 
+###### References
+
+- https://css-tricks.com/css-sprites/
+
 ### What are your favorite image replacement techniques and which do you use when?
 
 CSS image replacement is a technique of replacing a text element (usually a header tag like an `<h1>`) with an image (often a logo). It has its origins in the time before web fonts and SVG. For years, web developers battled against browser inconsistencies to craft image replacement techniques that struck the right balance between design and accessibility.

From d8ceb721fbf397aae7a6cb820d6956cca8907c72 Mon Sep 17 00:00:00 2001
From: Alex Prut <mail@alexprut.com>
Date: Fri, 27 Oct 2017 19:03:22 +0200
Subject: [PATCH 69/71] CSS - Question expansion: What are the different ways
 to visually hid...? (#80)

---
 front-end/interview-questions.md | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/front-end/interview-questions.md b/front-end/interview-questions.md
index 47d8f7fc..bded37d5 100644
--- a/front-end/interview-questions.md
+++ b/front-end/interview-questions.md
@@ -335,8 +335,16 @@ These techniques are related to accessibility (a11y).
 - `width: 0; height: 0`. Make the element not take up any space on the screen at all, resulting in not showing it.
 - `position: absolute; left: -99999px`. Position it outside of the screen.
 - `text-indent: -9999px`. This only works on text within the `block` elements.
+- Metadata. For example by using Schema.org, RDF and JSON-LD.
+- WAI-ARIA. A W3C technical specification that specifies how to increase the accessibility of web pages.
 
-I would go with the `absolute` positioning approach, as it has the least caveats and works for most elements.
+Even if WAI-ARIA is the ideal solution, I would go with the `absolute` positioning approach, as it has the least caveats, works for most elements and it's an easy technique.
+
+###### References
+
+- https://www.w3.org/TR/wai-aria-1.1/
+- https://developer.mozilla.org/en-US/docs/Web/Accessibility/ARIA
+- http://a11yproject.com/
 
 ### Have you ever used a grid system, and if so, what do you prefer?
 

From 9ce52c02ddc259c329c3bf769353fdae6328b48c Mon Sep 17 00:00:00 2001
From: Gunnar Mills <gmills@us.ibm.com>
Date: Fri, 27 Oct 2017 20:51:28 -0500
Subject: [PATCH 70/71] Corrected spelling mistake (#81)

---
 front-end/accessibility.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/front-end/accessibility.md b/front-end/accessibility.md
index dd470f0e..e6f61451 100644
--- a/front-end/accessibility.md
+++ b/front-end/accessibility.md
@@ -67,7 +67,7 @@ The following is a checklist that contains recommendations for implementing HTML
 - Accessibility tree = DOM + ARIA.
 - ARIA attributes
   - Allow us to modify the accessibility tree before they are exposed to assistive technologies.
-  - DO NOT modify the element apperance.
+  - DO NOT modify the element appearance.
   - DO NOT modify element behaviour.
   - DO NOT add focusability.
   - DO NOT add keyboard event handling.

From d1688df5ed14aad3f3f1e173cbae403d30ec9c8b Mon Sep 17 00:00:00 2001
From: Jim Poulakos <jimpoulakos@users.noreply.github.com>
Date: Tue, 31 Oct 2017 10:09:45 -0500
Subject: [PATCH 71/71] docs: fix grammatical errors (#83)

* docs: fix grammatical errors

* Update README.md
---
 README.md               | 4 ++--
 preparing/cheatsheet.md | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/README.md b/README.md
index a63fddab..2c6f92c8 100644
--- a/README.md
+++ b/README.md
@@ -28,7 +28,7 @@ This handbook is pretty new and help from you in contributing content would be v
 
 ## Why do I want this?
 
-This repository has *practical* content that covers all phases of a technical interview; from applying for a job to passing the interviews to offer negotiation. Technically competent candidates might still find the non-technical content helpful as well.
+This repository has *practical* content that covers all phases of a technical interview, from applying for a job to passing the interviews to offer negotiation. Technically competent candidates might still find the non-technical content helpful as well.
 
 ## Who is this for?
 
@@ -38,7 +38,7 @@ Anybody who wants to land a job at a tech company but is new to technical interv
 
 There are so many awesome books like [Cracking the Coding Interview](http://www.crackingthecodinginterview.com/) 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. 😎
+Also, existing resources focus mainly on algorithm questions and lack coverage for more domain-specific and non-technical questions. This handbook aims to cover content beyond the typical algorithmic coding questions. 😎
 
 ## Contents
 
diff --git a/preparing/cheatsheet.md b/preparing/cheatsheet.md
index c750f0ff..5d2f8ff6 100644
--- a/preparing/cheatsheet.md
+++ b/preparing/cheatsheet.md
@@ -1,7 +1,7 @@
 Interview Cheatsheet
 ==
 
-This is a straight-to-the-point distilled list of technical interview Do's and Don'ts, mainly for algorithmic interviews. Some of these may apply to only phone screens on whiteboard interviews but most will apply to both. I revise this list before each of my interviews to remind myself of them and eventually internalized all of them to the point I do not have to rely on it anymore.
+This is a straight-to-the-point, distilled list of technical interview Do's and Don'ts, mainly for algorithmic interviews. Some of these may apply to only phone screens or whiteboard interviews, but most will apply to both. I revise this list before each of my interviews to remind myself of them and eventually internalized all of them to the point I do not have to rely on it anymore.
 
 For a detailed walkthrough of interview preparation, refer to the ["Preparing for a Coding Interview"](./) section.
 
@@ -30,7 +30,7 @@ For a detailed walkthrough of interview preparation, refer to the ["Preparing fo
 |✅|Introduce yourself in a few sentences under a minute or two.|
 |✅|Mention interesting points that are relevant to the role you are applying for.|
 |✅|Sound enthusiastic! Speak with a smile and you will naturally sound more engaging.|
-|❌|Spend too long introducing yourself. The more time you spend talk the less time you have to code.|
+|❌|Spend too long introducing yourself. The more time you spend talking the less time you have to code.|
 
 ### 3. Upon Getting the Question