diff --git a/contents/algorithms/array.md b/contents/algorithms/array.md
index 1064a364..d119b57d 100644
--- a/contents/algorithms/array.md
+++ b/contents/algorithms/array.md
@@ -15,6 +15,10 @@ sidebar_label: Array
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Arrays hold values of the same type at contiguous memory locations. In an array, we're usually concerned about two things - the position/index of an element and the element itself. Different programming languages implement arrays under the hood differently and can affect the time complexity of operations you make to the array. In some languages like Python, JavaScript, Ruby, PHP, the array (or list in Python) size is dynamic and you do not need to have a size defined beforehand when creating the array. As a result, people usually have an easier time using these languages for interviews.
diff --git a/contents/algorithms/binary.md b/contents/algorithms/binary.md
index da5594d5..939e1762 100644
--- a/contents/algorithms/binary.md
+++ b/contents/algorithms/binary.md
@@ -15,6 +15,10 @@ sidebar_label: Binary
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Knowledge of binary number system and bit manipulation is less important in coding interviews as most Software Engineers do not have to deal with bits, which is more commonly used when dealing with lower level systems and programming languages. They are still asked sometimes, so you should at least still know how to convert a number from decimal form into binary form, and vice versa, in your chosen programming language.
diff --git a/contents/algorithms/dynamic-programming.md b/contents/algorithms/dynamic-programming.md
index a8ed5d4f..b4223703 100644
--- a/contents/algorithms/dynamic-programming.md
+++ b/contents/algorithms/dynamic-programming.md
@@ -15,6 +15,10 @@ sidebar_label: Dynamic programming
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Dynamic Programming (DP) is usually used to solve optimization problems. The only way to get better at DP is to practice. It takes some amount of practice to be able to recognize that a problem can be solved by DP.
diff --git a/contents/algorithms/geometry.md b/contents/algorithms/geometry.md
index 13a8c932..13ba6af3 100644
--- a/contents/algorithms/geometry.md
+++ b/contents/algorithms/geometry.md
@@ -15,6 +15,10 @@ sidebar_label: Geometry
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Geometry is a branch of mathematics that is concerned with properties of space that are related with distance, shape, size, and relative position of figures. Advanced geometry (e.g. 3D geometry) is not taught in most Computer Science courses, so you can expect that you will only be asked on 2D geometry.
diff --git a/contents/algorithms/graph.md b/contents/algorithms/graph.md
index 9f3f17ee..1778489d 100644
--- a/contents/algorithms/graph.md
+++ b/contents/algorithms/graph.md
@@ -15,6 +15,10 @@ sidebar_label: Graph
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
A graph is a structure containing a set of objects (nodes or vertices) where there can be edges between these nodes/vertices. Edges can be directed or undirected and can optionally have values (a weighted graph). Trees are undirected graphs in which any two vertices are connected by exactly one edge and there can be no cycles in the graph.
diff --git a/contents/algorithms/hash-table.md b/contents/algorithms/hash-table.md
index ea49ee5d..d7050fc4 100644
--- a/contents/algorithms/hash-table.md
+++ b/contents/algorithms/hash-table.md
@@ -15,6 +15,10 @@ sidebar_label: Hash table
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
A hash table (commonly referred to as hash map) a data structure that implements an associative array abstract data type, a structure that can map keys to values. A hash table uses a hash function on an element to compute an index, also called a hash code, into an array of buckets or slots, from which the desired value can be found. During lookup, the key is hashed and the resulting hash indicates where the corresponding value is stored.
diff --git a/contents/algorithms/heap.md b/contents/algorithms/heap.md
index aedbbe7c..1e9285b9 100644
--- a/contents/algorithms/heap.md
+++ b/contents/algorithms/heap.md
@@ -15,6 +15,10 @@ sidebar_label: Heap
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
A heap is a specialized tree-based data structure which is a complete tree that satisfies the heap property.
diff --git a/contents/algorithms/interval.md b/contents/algorithms/interval.md
index 8b574713..829cad79 100644
--- a/contents/algorithms/interval.md
+++ b/contents/algorithms/interval.md
@@ -15,6 +15,10 @@ sidebar_label: Interval
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Interval questions are a subset of [array](./array.md) questions where you are given an array of two-element arrays (an interval) and the two values represent a start and an end value. Interval questions are considered part of the array family but they involve some common techniques hence they are extracted out to this special section of their own.
diff --git a/contents/algorithms/linked-list.md b/contents/algorithms/linked-list.md
index 09494372..8aee4d46 100644
--- a/contents/algorithms/linked-list.md
+++ b/contents/algorithms/linked-list.md
@@ -15,6 +15,10 @@ sidebar_label: Linked list
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Like arrays, a linked list is used to represent sequential data. It is a linear collection of data elements whose order is not given by their physical placement in memory, as opposed to arrays, where data is stored in sequential blocks of memory. Instead, each element contains an address of the next element. It is a data structure consisting of a collection of nodes which together represent a sequence.
diff --git a/contents/algorithms/math.md b/contents/algorithms/math.md
index d25233bf..2edb8de8 100644
--- a/contents/algorithms/math.md
+++ b/contents/algorithms/math.md
@@ -15,6 +15,10 @@ sidebar_label: Math
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Math is a foundational aspect of Computer Science and every programmer and computer scientist needs to have basic mathematical knowledge. Thankfully, for the purpose of coding interviews, there usually won't be that much math involved, but some basic math techniques is helpful to know as you may be asked to implement mathematical operations.
diff --git a/contents/algorithms/matrix.md b/contents/algorithms/matrix.md
index 3c24c77f..ba602aa4 100644
--- a/contents/algorithms/matrix.md
+++ b/contents/algorithms/matrix.md
@@ -15,6 +15,10 @@ sidebar_label: Matrix
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
A matrix is a 2-dimensional array. Questions involving matrices are usually related to [dynamic programming](./dynamic-programming.md) or [graph](./graph.md) traversal.
diff --git a/contents/algorithms/queue.md b/contents/algorithms/queue.md
index b3920f99..b6e22a94 100644
--- a/contents/algorithms/queue.md
+++ b/contents/algorithms/queue.md
@@ -15,6 +15,10 @@ sidebar_label: Queue
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
A queue is a linear collection of elements that are maintained in a sequence and can be modified by the addition of elements at one end of the sequence (**enqueue** operation) and the removal of elements from the other end (**dequeue** operation). Usually, the end of the sequence at which elements are added is called the back, tail, or rear of the queue, and the end at which elements are removed is called the head or front of the queue. As an abstract data type, queues can be implemented using arrays or singly linked lists.
diff --git a/contents/algorithms/recursion.md b/contents/algorithms/recursion.md
index 46f084f6..7cd6ab19 100644
--- a/contents/algorithms/recursion.md
+++ b/contents/algorithms/recursion.md
@@ -15,6 +15,10 @@ sidebar_label: Recursion
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem.
diff --git a/contents/algorithms/sorting-searching.md b/contents/algorithms/sorting-searching.md
index e6c66c5f..28004956 100644
--- a/contents/algorithms/sorting-searching.md
+++ b/contents/algorithms/sorting-searching.md
@@ -15,6 +15,10 @@ sidebar_label: Sorting and searching
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Sorting is the act of rearranging elements in a sequence in order, either in numerical or lexicographical order, and either ascending or descending.
diff --git a/contents/algorithms/stack.md b/contents/algorithms/stack.md
index 25aec61e..b709264c 100644
--- a/contents/algorithms/stack.md
+++ b/contents/algorithms/stack.md
@@ -15,6 +15,10 @@ sidebar_label: Stack
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
A a stack is an abstract data type that supports the operations **push** (insert a new element on the top of the stack) and **pop** (remove and return the most recently added element, the element at the top of the stack). As an abstract data type, stacks can be implemented using arrays or singly linked lists.
diff --git a/contents/algorithms/string.md b/contents/algorithms/string.md
index 3ffdb633..00c7780f 100644
--- a/contents/algorithms/string.md
+++ b/contents/algorithms/string.md
@@ -15,6 +15,10 @@ sidebar_label: String
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
A string is a sequence of characters. Many tips that apply to arrays also apply to strings. You're recommended to read the page on [Arrays](./array.md) before reading this page.
diff --git a/contents/algorithms/study-cheatsheet.md b/contents/algorithms/study-cheatsheet.md
index d31be4b3..9449a12a 100644
--- a/contents/algorithms/study-cheatsheet.md
+++ b/contents/algorithms/study-cheatsheet.md
@@ -6,6 +6,10 @@ keywords: [coding interview algorithms, coding interview data structures]
sidebar_label: Introduction
---
+
+
+
+
import InDocAd from '../\_components/InDocAd';
## What is this
diff --git a/contents/algorithms/tree.md b/contents/algorithms/tree.md
index b878788d..7024c9ef 100644
--- a/contents/algorithms/tree.md
+++ b/contents/algorithms/tree.md
@@ -15,6 +15,10 @@ sidebar_label: Tree
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
A tree is a widely used abstract data type that represents a hierarchical structure with a set of connected nodes. Each node in the tree can be connected to many children, but must be connected to exactly one parent, except for the root node, which has no parent.
diff --git a/contents/algorithms/trie.md b/contents/algorithms/trie.md
index bfb9a245..096128fe 100644
--- a/contents/algorithms/trie.md
+++ b/contents/algorithms/trie.md
@@ -15,6 +15,10 @@ sidebar_label: Trie
toc_max_heading_level: 2
---
+
+
+
+
## Introduction
Tries are special trees (prefix trees) that make searching and storing strings more efficient. Tries have many practical applications, such as conducting searches and providing autocomplete. It is helpful to know these common applications so that you can easily identify when a problem can be efficiently solved using a trie.
diff --git a/contents/behavioral-interview-questions.md b/contents/behavioral-interview-questions.md
index fa15cf75..17a7aab0 100644
--- a/contents/behavioral-interview-questions.md
+++ b/contents/behavioral-interview-questions.md
@@ -15,6 +15,10 @@ keywords:
sidebar_label: Common behavioral questions to practice
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
In the software engineer interview process, behavioral interviews may seem so much more varied and unstructured as compared to technical interviews. However, in most cases, the interviewer is actually just trying to get to know you better and there's always a set of common questions that need to be asked to achieve that.
diff --git a/contents/behavioral-interview.md b/contents/behavioral-interview.md
index 27f35318..1705f149 100644
--- a/contents/behavioral-interview.md
+++ b/contents/behavioral-interview.md
@@ -16,6 +16,10 @@ keywords:
sidebar_label: Step-by-step how to prepare
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
## What are behavioral interviews
diff --git a/contents/best-practice-questions.md b/contents/best-practice-questions.md
index 44e256d0..8f8d4a9a 100644
--- a/contents/best-practice-questions.md
+++ b/contents/best-practice-questions.md
@@ -8,6 +8,7 @@ displayed_sidebar: docs
pagination_next: coding-interview-cheatsheet
---
+
import AlgorithmCourses from './\_courses/AlgorithmCourses.md'
import InDocAd from './\_components/InDocAd';
diff --git a/contents/coding-interview-cheatsheet.md b/contents/coding-interview-cheatsheet.md
index 324938a8..3ffee58d 100644
--- a/contents/coding-interview-cheatsheet.md
+++ b/contents/coding-interview-cheatsheet.md
@@ -15,6 +15,10 @@ keywords:
sidebar_label: Best practices before, during, and after
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
As coding interviews mature over the years, there are now firmer expectations on how candidates should behave during a coding interview. Some of these practices also help you to exhibit "hire" signals to the interviewer by displaying your ability to communicate well and deal with roadblocks.
diff --git a/contents/coding-interview-prep.md b/contents/coding-interview-prep.md
index a7c9d4c4..eab0523a 100644
--- a/contents/coding-interview-prep.md
+++ b/contents/coding-interview-prep.md
@@ -18,6 +18,10 @@ keywords:
sidebar_label: Step-by-step how to prepare
---
+
+
+
+
_The ultimate guide on how to efficiently prepare for your software engineering technical interview - coding test round._
If you have decided to embark on the arduous process of preparing for your coding interviews and you don't know how to maximize your time, this is the only guide you need to go from zero to hero on your coding test.
diff --git a/contents/coding-interview-rubrics.md b/contents/coding-interview-rubrics.md
index 5c2f4ae0..78b36604 100644
--- a/contents/coding-interview-rubrics.md
+++ b/contents/coding-interview-rubrics.md
@@ -13,6 +13,10 @@ keywords:
sidebar_label: Coding interview rubrics
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
Ever wondered how coding interviews are evaluated at top tech companies like Google, Amazon, Apple and Netflix?
diff --git a/contents/coding-interview-study-plan.md b/contents/coding-interview-study-plan.md
index f4411ce9..e517598e 100644
--- a/contents/coding-interview-study-plan.md
+++ b/contents/coding-interview-study-plan.md
@@ -13,6 +13,10 @@ keywords:
sidebar_label: Study and practice plan
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
import QuestionList from './\_components/QuestionList';
diff --git a/contents/coding-interview-techniques.md b/contents/coding-interview-techniques.md
index 11502599..9e90f4ee 100644
--- a/contents/coding-interview-techniques.md
+++ b/contents/coding-interview-techniques.md
@@ -15,6 +15,10 @@ keywords:
sidebar_label: Techniques to solve questions
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
The biggest fear most candidates will have during a coding interview is: what if I get stuck on the question and don't know how to do it? Fortunately, there are structured ways to approach coding interview questions that will increase your chances of solving them. From how to find a solution or approach, to optimizing time and space complexity, here are some of the top tips and best practices that will help you solve coding interview questions.
diff --git a/contents/final-questions.md b/contents/final-questions.md
index 60bf47c0..29f86dc5 100644
--- a/contents/final-questions.md
+++ b/contents/final-questions.md
@@ -12,6 +12,10 @@ keywords:
sidebar_label: Preparing final questions to ask
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
Something you can always count on to happen at the end of your Software Engineer interview - both technical and non-technical rounds - is for the interviewer to ask you if you "have any final questions?".
diff --git a/contents/mock-interviews.md b/contents/mock-interviews.md
index 1570aac0..d90a7d93 100644
--- a/contents/mock-interviews.md
+++ b/contents/mock-interviews.md
@@ -16,6 +16,10 @@ keywords:
sidebar_label: Mock coding interviews
---
+
+
+
+
Interviewing is a skill that you can get better at. The steps mentioned above can be rehearsed over and over again until you have fully internalized them and following those steps become second nature to you. A good way to practice is to find a friend to partner with and the both of you can take turns to interview each other.
## [interviewing.io](https://iio.sh/r/DMCa)
diff --git a/contents/negotiation-rules.md b/contents/negotiation-rules.md
index 070d1cd1..8f8d59e6 100644
--- a/contents/negotiation-rules.md
+++ b/contents/negotiation-rules.md
@@ -16,6 +16,10 @@ keywords:
]
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
Key points extracted from "Ten Rules for Negotiating a Job Offer" [Part 1](http://haseebq.com/my-ten-rules-for-negotiating-a-job-offer/) and [Part 2](https://haseebq.com/how-not-to-bomb-your-offer-negotiation/) by Haseeb Qureshi.
diff --git a/contents/negotiation.md b/contents/negotiation.md
index 6c5795c2..57fefabd 100644
--- a/contents/negotiation.md
+++ b/contents/negotiation.md
@@ -19,6 +19,7 @@ sidebar_label: Complete salary negotiation guide
What you need to know about negotiation | Tech Interview Handbook
+
## Always negotiate
diff --git a/contents/programming-languages-for-coding-interviews.md b/contents/programming-languages-for-coding-interviews.md
index ac3e91ab..b9a4eafb 100644
--- a/contents/programming-languages-for-coding-interviews.md
+++ b/contents/programming-languages-for-coding-interviews.md
@@ -14,6 +14,10 @@ keywords:
sidebar_label: Picking a programming language
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
Does the programming language you use for coding interviews matter? The answer is yes.
diff --git a/contents/resume.md b/contents/resume.md
index d0d3f59b..03c1efed 100644
--- a/contents/resume.md
+++ b/contents/resume.md
@@ -15,6 +15,10 @@ keywords:
sidebar_label: Writing your software engineer resume
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
Not sure why you're still not getting shortlisted at some or all of the top tech companies? Your software engineer resume could be the issue.
diff --git a/contents/self-introduction.md b/contents/self-introduction.md
index 5cc64efe..2d040ae5 100644
--- a/contents/self-introduction.md
+++ b/contents/self-introduction.md
@@ -13,6 +13,10 @@ keywords:
sidebar_label: Preparing a self introduction
---
+
+
+
+
import InDocAd from './\_components/InDocAd';
"Tell me about yourself" or "give me a quick introduction of your profile" is almost always the first question encountered in your software engineer interviews. This guide teaches you how to maximize this chance to impress the interviewer by crafting the perfect self introduction.
diff --git a/contents/software-engineering-interview-guide.md b/contents/software-engineering-interview-guide.md
index 60dba4a2..9229c1e6 100644
--- a/contents/software-engineering-interview-guide.md
+++ b/contents/software-engineering-interview-guide.md
@@ -16,6 +16,10 @@ keywords:
sidebar_label: 'SWE interviews: What are they and how to prepare'
---
+
+
+
+
Nobody has time to grind hundreds of LeetCode questions, and the good news is that you don't need to do that many to actually get the job at FAANG!
I was frustrated at my job at Grab, a ridesharing company in South-east Asia and wanted to break into FAANG but I wasn't sure how to. After a few months of research, studying and practicing, I interviewed at 11 companies and managed to get 9 offers from top tech companies in the Bay Area - Facebook, Google, Airbnb, Palantir, Dropbox, Lyft, and some startups. It was a tedious process which I don't ever want to go through again. **I went through that process but with this guide, you don't have to.**
diff --git a/contents/system-design.md b/contents/system-design.md
index 6729c8be..e1db9581 100644
--- a/contents/system-design.md
+++ b/contents/system-design.md
@@ -11,6 +11,10 @@ keywords:
sidebar_label: System design preparation guide
---
+
+
+
+
The objective of system design interviews is to evaluate a candidate's skill at designing real-world software systems involving multiple components. System design questions are typically given to more senior candidates (with a few years of experience). Interns aren't typically given system design questions as it is hard to expect interns to have sufficient and relevant industry experience to answer this type of questions well.
Some common questions include:
diff --git a/website/static/social/algorithms/algorithms-array.png b/website/static/social/algorithms/algorithms-array.png
new file mode 100644
index 00000000..f4142d1f
Binary files /dev/null and b/website/static/social/algorithms/algorithms-array.png differ
diff --git a/website/static/social/algorithms/algorithms-binary.png b/website/static/social/algorithms/algorithms-binary.png
new file mode 100644
index 00000000..104dd766
Binary files /dev/null and b/website/static/social/algorithms/algorithms-binary.png differ
diff --git a/website/static/social/algorithms/algorithms-dynamic-programming.png b/website/static/social/algorithms/algorithms-dynamic-programming.png
new file mode 100644
index 00000000..e01d6afb
Binary files /dev/null and b/website/static/social/algorithms/algorithms-dynamic-programming.png differ
diff --git a/website/static/social/algorithms/algorithms-geometry.png b/website/static/social/algorithms/algorithms-geometry.png
new file mode 100644
index 00000000..c22b1af1
Binary files /dev/null and b/website/static/social/algorithms/algorithms-geometry.png differ
diff --git a/website/static/social/algorithms/algorithms-graph.png b/website/static/social/algorithms/algorithms-graph.png
new file mode 100644
index 00000000..ce25bd81
Binary files /dev/null and b/website/static/social/algorithms/algorithms-graph.png differ
diff --git a/website/static/social/algorithms/algorithms-hash-table.png b/website/static/social/algorithms/algorithms-hash-table.png
new file mode 100644
index 00000000..db4e514f
Binary files /dev/null and b/website/static/social/algorithms/algorithms-hash-table.png differ
diff --git a/website/static/social/algorithms/algorithms-heap.png b/website/static/social/algorithms/algorithms-heap.png
new file mode 100644
index 00000000..cf184b70
Binary files /dev/null and b/website/static/social/algorithms/algorithms-heap.png differ
diff --git a/website/static/social/algorithms/algorithms-interval.png b/website/static/social/algorithms/algorithms-interval.png
new file mode 100644
index 00000000..a7b6044a
Binary files /dev/null and b/website/static/social/algorithms/algorithms-interval.png differ
diff --git a/website/static/social/algorithms/algorithms-linked-list.png b/website/static/social/algorithms/algorithms-linked-list.png
new file mode 100644
index 00000000..daf2acb5
Binary files /dev/null and b/website/static/social/algorithms/algorithms-linked-list.png differ
diff --git a/website/static/social/algorithms/algorithms-math.png b/website/static/social/algorithms/algorithms-math.png
new file mode 100644
index 00000000..2aacd39f
Binary files /dev/null and b/website/static/social/algorithms/algorithms-math.png differ
diff --git a/website/static/social/algorithms/algorithms-matrix.png b/website/static/social/algorithms/algorithms-matrix.png
new file mode 100644
index 00000000..8dffe50f
Binary files /dev/null and b/website/static/social/algorithms/algorithms-matrix.png differ
diff --git a/website/static/social/algorithms/algorithms-queue.png b/website/static/social/algorithms/algorithms-queue.png
new file mode 100644
index 00000000..1af9e0e9
Binary files /dev/null and b/website/static/social/algorithms/algorithms-queue.png differ
diff --git a/website/static/social/algorithms/algorithms-recursion.png b/website/static/social/algorithms/algorithms-recursion.png
new file mode 100644
index 00000000..8fa372f7
Binary files /dev/null and b/website/static/social/algorithms/algorithms-recursion.png differ
diff --git a/website/static/social/algorithms/algorithms-sorting-searching.png b/website/static/social/algorithms/algorithms-sorting-searching.png
new file mode 100644
index 00000000..9b83ddc1
Binary files /dev/null and b/website/static/social/algorithms/algorithms-sorting-searching.png differ
diff --git a/website/static/social/algorithms/algorithms-stack.png b/website/static/social/algorithms/algorithms-stack.png
new file mode 100644
index 00000000..29555c9e
Binary files /dev/null and b/website/static/social/algorithms/algorithms-stack.png differ
diff --git a/website/static/social/algorithms/algorithms-string.png b/website/static/social/algorithms/algorithms-string.png
new file mode 100644
index 00000000..d6840166
Binary files /dev/null and b/website/static/social/algorithms/algorithms-string.png differ
diff --git a/website/static/social/algorithms/algorithms-study-cheatsheet.png b/website/static/social/algorithms/algorithms-study-cheatsheet.png
new file mode 100644
index 00000000..a78867e8
Binary files /dev/null and b/website/static/social/algorithms/algorithms-study-cheatsheet.png differ
diff --git a/website/static/social/algorithms/algorithms-tree.png b/website/static/social/algorithms/algorithms-tree.png
new file mode 100644
index 00000000..40898b8d
Binary files /dev/null and b/website/static/social/algorithms/algorithms-tree.png differ
diff --git a/website/static/social/algorithms/algorithms-trie.png b/website/static/social/algorithms/algorithms-trie.png
new file mode 100644
index 00000000..9d179664
Binary files /dev/null and b/website/static/social/algorithms/algorithms-trie.png differ
diff --git a/website/static/social/behavioral-interview-questions.png b/website/static/social/behavioral-interview-questions.png
new file mode 100644
index 00000000..6c5c15b4
Binary files /dev/null and b/website/static/social/behavioral-interview-questions.png differ
diff --git a/website/static/social/behavioral-interview.png b/website/static/social/behavioral-interview.png
new file mode 100644
index 00000000..4aaa6511
Binary files /dev/null and b/website/static/social/behavioral-interview.png differ
diff --git a/website/static/social/coding-interview-cheatsheet.png b/website/static/social/coding-interview-cheatsheet.png
new file mode 100644
index 00000000..e4185878
Binary files /dev/null and b/website/static/social/coding-interview-cheatsheet.png differ
diff --git a/website/static/social/coding-interview-prep.png b/website/static/social/coding-interview-prep.png
new file mode 100644
index 00000000..4728ab9f
Binary files /dev/null and b/website/static/social/coding-interview-prep.png differ
diff --git a/website/static/social/coding-interview-rubrics.png b/website/static/social/coding-interview-rubrics.png
new file mode 100644
index 00000000..3cdc61bc
Binary files /dev/null and b/website/static/social/coding-interview-rubrics.png differ
diff --git a/website/static/social/coding-interview-study-plan.png b/website/static/social/coding-interview-study-plan.png
new file mode 100644
index 00000000..f74f2e56
Binary files /dev/null and b/website/static/social/coding-interview-study-plan.png differ
diff --git a/website/static/social/coding-interview-techniques.png b/website/static/social/coding-interview-techniques.png
new file mode 100644
index 00000000..7774228a
Binary files /dev/null and b/website/static/social/coding-interview-techniques.png differ
diff --git a/website/static/social/final-questions.png b/website/static/social/final-questions.png
new file mode 100644
index 00000000..cb73bfd1
Binary files /dev/null and b/website/static/social/final-questions.png differ
diff --git a/website/static/social/mock-interviews.png b/website/static/social/mock-interviews.png
new file mode 100644
index 00000000..06c4138a
Binary files /dev/null and b/website/static/social/mock-interviews.png differ
diff --git a/website/static/social/negotiation.png b/website/static/social/negotiation.png
new file mode 100644
index 00000000..7f26ec6e
Binary files /dev/null and b/website/static/social/negotiation.png differ
diff --git a/website/static/social/programming-languages-for-coding-interviews.png b/website/static/social/programming-languages-for-coding-interviews.png
new file mode 100644
index 00000000..f9963c98
Binary files /dev/null and b/website/static/social/programming-languages-for-coding-interviews.png differ
diff --git a/website/static/social/resume.png b/website/static/social/resume.png
new file mode 100644
index 00000000..b0fb512d
Binary files /dev/null and b/website/static/social/resume.png differ
diff --git a/website/static/social/self-introduction.png b/website/static/social/self-introduction.png
new file mode 100644
index 00000000..c1b886a0
Binary files /dev/null and b/website/static/social/self-introduction.png differ
diff --git a/website/static/social/software-engineering-interview-guide.png b/website/static/social/software-engineering-interview-guide.png
new file mode 100644
index 00000000..ce83a3b3
Binary files /dev/null and b/website/static/social/software-engineering-interview-guide.png differ
diff --git a/website/static/social/system-design.png b/website/static/social/system-design.png
new file mode 100644
index 00000000..ff8e30f0
Binary files /dev/null and b/website/static/social/system-design.png differ