mirror of
https://github.com/yangshun/tech-interview-handbook.git
synced 2025-07-28 04:33:42 +08:00
website: add sidebar structure
This commit is contained in:
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: array
|
||||
title: Array
|
||||
title: Array cheatsheet for coding interviews
|
||||
description: Array study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
array coding interview study guide,
|
||||
array tips for coding interviews,
|
||||
array practice questions,
|
||||
array useful techniques,
|
||||
array time complexity,
|
||||
array recommended study resources,
|
||||
]
|
||||
sidebar_label: Array
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: binary
|
||||
title: Binary
|
||||
title: Binary cheatsheet for coding interviews
|
||||
description: binary study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
binary coding interview study guide,
|
||||
binary tips for coding interviews,
|
||||
binary practice questions,
|
||||
binary useful techniques,
|
||||
binary time complexity,
|
||||
binary recommended study resources,
|
||||
]
|
||||
sidebar_label: Binary
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: dynamic-programming
|
||||
title: Dynamic programming
|
||||
title: Dynamic programming cheatsheet for coding interviews
|
||||
description: Dynamic programming study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
dynamic programming coding interview study guide,
|
||||
dynamic programming tips for coding interviews,
|
||||
dynamic programming practice questions,
|
||||
dynamic programming useful techniques,
|
||||
dynamic programming time complexity,
|
||||
dynamic programming recommended study resources,
|
||||
]
|
||||
sidebar_label: Dynamic programming
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: geometry
|
||||
title: Geometry
|
||||
title: Geometry cheatsheet for coding interviews
|
||||
description: Geometry study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
geometry coding interview study guide,
|
||||
geometry tips for coding interviews,
|
||||
geometry practice questions,
|
||||
geometry useful techniques,
|
||||
geometry time complexity,
|
||||
geometry recommended study resources,
|
||||
]
|
||||
sidebar_label: Geometry
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: graph
|
||||
title: Graph
|
||||
title: Graph cheatsheet for coding interviews
|
||||
description: Graph study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
graph coding interview study guide,
|
||||
graph tips for coding interviews,
|
||||
graph practice questions,
|
||||
graph useful techniques,
|
||||
graph time complexity,
|
||||
graph recommended study resources,
|
||||
]
|
||||
sidebar_label: Graph
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: hash-table
|
||||
title: Hash Table
|
||||
title: Hash table cheatsheet for coding interviews
|
||||
description: Hash table study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
hash table coding interview study guide,
|
||||
hash table tips for coding interviews,
|
||||
hash table practice questions,
|
||||
hash table useful techniques,
|
||||
hash table time complexity,
|
||||
hash table recommended study resources,
|
||||
]
|
||||
sidebar_label: Hash table
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: heap
|
||||
title: Heap
|
||||
title: Heap cheatsheet for coding interviews
|
||||
description: Heap study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
heap coding interview study guide,
|
||||
heap tips for coding interviews,
|
||||
heap practice questions,
|
||||
heap useful techniques,
|
||||
heap time complexity,
|
||||
heap recommended study resources,
|
||||
]
|
||||
sidebar_label: Heap
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: interval
|
||||
title: Interval
|
||||
title: Interval cheatsheet for coding interviews
|
||||
description: Interval study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
interval coding interview study guide,
|
||||
interval tips for coding interviews,
|
||||
interval practice questions,
|
||||
interval useful techniques,
|
||||
interval time complexity,
|
||||
interval recommended study resources,
|
||||
]
|
||||
sidebar_label: Interval
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: linked-list
|
||||
title: Linked list
|
||||
title: Linked list cheatsheet for coding interviews
|
||||
description: Linked list study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
linked list coding interview study guide,
|
||||
linked list tips for coding interviews,
|
||||
linked list practice questions,
|
||||
linked list useful techniques,
|
||||
linked list time complexity,
|
||||
linked list recommended study resources,
|
||||
]
|
||||
sidebar_label: Linked list
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: math
|
||||
title: Math
|
||||
title: Math cheatsheet for coding interviews
|
||||
description: Math study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
math coding interview study guide,
|
||||
math tips for coding interviews,
|
||||
math practice questions,
|
||||
math useful techniques,
|
||||
math time complexity,
|
||||
math recommended study resources,
|
||||
]
|
||||
sidebar_label: Math
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: matrix
|
||||
title: Matrix
|
||||
title: Matrix cheatsheet for coding interviews
|
||||
description: Matrix study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
matrix coding interview study guide,
|
||||
matrix tips for coding interviews,
|
||||
matrix practice questions,
|
||||
matrix useful techniques,
|
||||
matrix time complexity,
|
||||
matrix recommended study resources,
|
||||
]
|
||||
sidebar_label: Matrix
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: queue
|
||||
title: Queue
|
||||
title: Queue cheatsheet for coding interviews
|
||||
description: Queue study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
queue coding interview study guide,
|
||||
queue tips for coding interviews,
|
||||
queue practice questions,
|
||||
queue useful techniques,
|
||||
queue time complexity,
|
||||
queue recommended study resources,
|
||||
]
|
||||
sidebar_label: Queue
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: recursion
|
||||
title: Recursion
|
||||
title: Recursion cheatsheet for coding interviews
|
||||
description: Recursion study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
recursion coding interview study guide,
|
||||
recursion tips for coding interviews,
|
||||
recursion practice questions,
|
||||
recursion useful techniques,
|
||||
recursion time complexity,
|
||||
recursion recommended study resources,
|
||||
]
|
||||
sidebar_label: Recursion
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: sorting-searching
|
||||
title: Sorting and searching
|
||||
title: Sorting and searching cheatsheet for coding interviews
|
||||
description: Sorting and searching study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
sorting searching coding interview study guide,
|
||||
sorting searching tips for coding interviews,
|
||||
sorting searching practice questions,
|
||||
sorting searching useful techniques,
|
||||
sorting searching time complexity,
|
||||
sorting searching recommended study resources,
|
||||
]
|
||||
sidebar_label: Sorting and searching
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: stack
|
||||
title: Stack
|
||||
title: Stack cheatsheet for coding interviews
|
||||
description: Stack study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
stack coding interview study guide,
|
||||
stack tips for coding interviews,
|
||||
stack practice questions,
|
||||
stack useful techniques,
|
||||
stack time complexity,
|
||||
stack recommended study resources,
|
||||
]
|
||||
sidebar_label: Stack
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: string
|
||||
title: String
|
||||
title: String cheatsheet for coding interviews
|
||||
description: String study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
string coding interview study guide,
|
||||
string tips for coding interviews,
|
||||
string practice questions,
|
||||
string useful techniques,
|
||||
string time complexity,
|
||||
string recommended study resources,
|
||||
]
|
||||
sidebar_label: String
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,18 +1,53 @@
|
||||
---
|
||||
id: algorithms-introduction
|
||||
title: Algorithms tips
|
||||
description: Here are practical tips for each algorithm topic and data structure which appear frequently in coding interviews
|
||||
id: study-cheatsheet
|
||||
title: Data structures and algorithms study cheatsheets for coding interviews
|
||||
description: Study guides for coding interviews with focus on data structures and algorithms, including practice questions, techniques, time complexity and recommended resources
|
||||
keywords: [coding interview algorithms, coding interview data structures]
|
||||
sidebar_label: Introduction
|
||||
slug: introduction
|
||||
---
|
||||
|
||||
import InDocAd from '../\_components/InDocAd';
|
||||
|
||||
## What is this
|
||||
|
||||
This section dives deep into practical knowledge and techniques for algorithms and data structures which appear frequently in algorithm interviews. The more techniques you have in your arsenal, the higher the chances of passing the interview. They may lead you to discover corner cases you might have missed out or even lead you towards the optimal approach!
|
||||
|
||||
For each topic, a brief introduction is given, along with language-specific libraries to use, time complexities cheatsheet, things to look out for during interviews, corner cases, useful techniques, and recommended resources to help you master the topic. Lastly, 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.
|
||||
## Contents of each study guide
|
||||
|
||||
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.
|
||||
For each topic, you can expect to find:
|
||||
|
||||
1. A brief overview
|
||||
1. Learning resources
|
||||
1. Language-specific libraries to use
|
||||
1. Time complexities cheatsheet
|
||||
1. Things to look out for during interviews
|
||||
1. Corner cases
|
||||
1. Useful techniques vRecommended questions to practice
|
||||
|
||||
## Study guides list
|
||||
|
||||
Here is the list of data structures and algorithms you should prepare for coding interviews and their corresponding study guides:
|
||||
|
||||
| Topic | Priority |
|
||||
| ---------------------------------------------------------- | -------- |
|
||||
| [Array](./algorithms/array.md) | High |
|
||||
| [String](./algorithms/string.md) | High |
|
||||
| [Hash Table](./algorithms/hash-table.md) | Mid |
|
||||
| [Recursion](./algorithms/recursion.md) | Mid |
|
||||
| [Sorting and searching](./algorithms/sorting-searching.md) | High |
|
||||
| [Matrix](./algorithms/matrix.md) | High |
|
||||
| [Linked List](./algorithms/linked-list.md) | Mid |
|
||||
| [Queue](./algorithms/queue.md) | Mid |
|
||||
| [Stack](./algorithms/stack.md) | Mid |
|
||||
| [Tree](./algorithms/tree.md) | High |
|
||||
| [Graph](./algorithms/graph.md) | High |
|
||||
| [Heap](./algorithms/heap.md) | Mid |
|
||||
| [Trie](./algorithms/trie.md) | Mid |
|
||||
| [Interval](./algorithms/interval.md) | Mid |
|
||||
| [Dynamic programming](./algorithms/dynamic-programming.md) | Low |
|
||||
| [Binary](./algorithms/binary.md) | Low |
|
||||
| [Math](./algorithms/math.md) | Low |
|
||||
| [Geometry](./algorithms/geometry.md) | Low |
|
||||
|
||||
## General interview tips
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: tree
|
||||
title: Tree
|
||||
title: Tree cheatsheet for coding interviews
|
||||
description: Tree study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
tree coding interview study guide,
|
||||
tree tips for coding interviews,
|
||||
tree practice questions,
|
||||
tree useful techniques,
|
||||
tree time complexity,
|
||||
tree recommended study resources,
|
||||
]
|
||||
sidebar_label: Tree
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
@ -1,6 +1,17 @@
|
||||
---
|
||||
id: trie
|
||||
title: Trie
|
||||
title: Trie cheatsheet for coding interviews
|
||||
description: Trie study guide for coding interviews, including practice questions, techniques, time complexity, and recommended resources
|
||||
keywords:
|
||||
[
|
||||
trie coding interview study guide,
|
||||
trie tips for coding interviews,
|
||||
trie practice questions,
|
||||
trie useful techniques,
|
||||
trie time complexity,
|
||||
trie recommended study resources,
|
||||
]
|
||||
sidebar_label: Trie
|
||||
toc_max_heading_level: 2
|
||||
---
|
||||
|
||||
|
Reference in New Issue
Block a user