contents: tweak sidebar categorization

pull/260/head
Yangshun 3 years ago
parent 35fe7b463c
commit 64039bb395

@ -5,7 +5,7 @@ title: Best practice questions
Practicing is the best way to prepare for coding interviews. Years ago, I curated a list of the most important 75 questions on [LeetCode](https://leetcode.com). Many other LeetCode questions are a mash of the techniques from these individual questions. I used this list in my last job hunt to only do the important questions.
I [shared this list on Blind](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU) to save peoples' time when revising and someone reposted this list on [the LeetCode forums](https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions). It somehow blew up and became super famous in the coding interview scene, people even gave it a name - **Blind 75**. The Blind 75 questions as a LeetCode list can be found [here](https://leetcode.com/list/xi4ci4ig/).
I [shared this list on Blind](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-100-LeetCode-Questions-to-Save-Your-Time-OaM1orEU) to save peoples' time when revising and someone reposted this list on [the LeetCode forum](https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions). It somehow blew up and became super famous in the coding interview scene, people even gave it a name - **Blind 75**. The Blind 75 questions as a LeetCode list can be found [here](https://leetcode.com/list/xi4ci4ig/).
Years later, I further distilled the list down into only 50 questions and spread them across a 5-week schedule. Here is the suggested schedule for revising and practicing algorithm questions on LeetCode. Sign up for an account if you don't already have one, it's critical to your success in interviewing!

@ -1,6 +1,7 @@
---
id: system-design
title: System design interviews
sidebar_label: 🔥 System design interviews
---
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.

@ -4,7 +4,7 @@ module.exports = {
Preface: ['introduction', 'landscape'],
},
{
Resume: [
'Step 1: Preparing your resume': [
'resume',
'resume-checklist',
'resume-case-study',
@ -13,66 +13,76 @@ module.exports = {
],
},
{
'General interview tips': ['self-introduction', 'questions-to-ask'],
},
{
'Interview formats': [
'interview-formats',
'interview-formats-top-companies',
],
},
{
'Coding interviews': [
'coding-round-overview',
'picking-a-language',
'study-and-practice',
'best-practice-questions',
'during-coding-interview',
'cheatsheet',
'coding-signals',
'mock-interviews',
'interviewer-cheatsheet',
type: 'category',
label: 'Step 2: Acing the interview',
collapsed: false,
items: [
{
Algorithms: [
'algorithms/algorithms-introduction',
'algorithms/array',
'algorithms/binary',
'algorithms/dynamic-programming',
'algorithms/geometry',
'algorithms/graph',
'algorithms/hash-table',
'algorithms/heap',
'algorithms/interval',
'algorithms/linked-list',
'algorithms/math',
'algorithms/matrix',
'algorithms/oop',
'algorithms/permutation',
'algorithms/queue',
'algorithms/recursion',
'algorithms/sorting-searching',
'algorithms/stack',
'algorithms/string',
'algorithms/tree',
'algorithms/trie',
'Interview formats': [
'interview-formats',
'interview-formats-top-companies',
],
},
{
'General interview tips': ['self-introduction', 'questions-to-ask'],
},
{
'🔥 Coding interviews': [
'coding-round-overview',
'picking-a-language',
'study-and-practice',
'best-practice-questions',
'during-coding-interview',
'cheatsheet',
'coding-signals',
'mock-interviews',
'interviewer-cheatsheet',
{
Algorithms: [
'algorithms/algorithms-introduction',
'algorithms/array',
'algorithms/binary',
'algorithms/dynamic-programming',
'algorithms/geometry',
'algorithms/graph',
'algorithms/hash-table',
'algorithms/heap',
'algorithms/interval',
'algorithms/linked-list',
'algorithms/math',
'algorithms/matrix',
'algorithms/oop',
'algorithms/permutation',
'algorithms/queue',
'algorithms/recursion',
'algorithms/sorting-searching',
'algorithms/stack',
'algorithms/string',
'algorithms/tree',
'algorithms/trie',
],
},
],
},
'system-design',
{
'Behavioral interviews': [
'behavioral-round-overview',
'star-format',
'behavioral-questions',
'psychological-tricks',
],
},
],
},
'system-design',
{
'Behavioral interviews': [
'behavioral-round-overview',
'star-format',
'behavioral-questions',
'psychological-tricks',
'Step 3: Negotiating the best offer': [
'understanding-compensation',
'negotiation',
],
},
{
'Offer negotiation': ['understanding-compensation', 'negotiation'],
},
{
'Job preparation': [
'Step 4: Getting ready for your job': [
'choosing-between-companies',
'engineering-levels',
// 'team-selection',

Loading…
Cancel
Save