parent
13a8ed4222
commit
0535dd0d7f
@ -1,5 +1,5 @@
|
|||||||
# Algorithms
|
# Algorithms
|
||||||
|
|
||||||
The contents have been moved to the [website](https://techinterviewhandbook.org/algorithms/algorithms-introduction).
|
The contents have been moved to the [website](https://techinterviewhandbook.org/algorithms/introduction).
|
||||||
|
|
||||||
<!-- TODO: Remove in future -->
|
<!-- TODO: Remove in future -->
|
||||||
|
@ -1,71 +1,86 @@
|
|||||||
module.exports = {
|
module.exports = {
|
||||||
docs: {
|
docs: [
|
||||||
Preface: ['introduction', 'landscape'],
|
{
|
||||||
'Job Application': [
|
type: 'category',
|
||||||
'resume',
|
label: 'Preface',
|
||||||
'resume-case-study',
|
items: ['introduction', 'landscape'],
|
||||||
'resume-sample',
|
},
|
||||||
'cover-letter',
|
{
|
||||||
],
|
type: 'category',
|
||||||
'Interview Process': [
|
label: 'Job Application',
|
||||||
'interview-formats',
|
items: ['resume', 'resume-case-study', 'resume-sample', 'cover-letter'],
|
||||||
'self-introduction',
|
},
|
||||||
{
|
{
|
||||||
type: 'category',
|
type: 'category',
|
||||||
label: 'Coding Round',
|
label: 'Interview Process',
|
||||||
items: [
|
items: [
|
||||||
'coding-round-overview',
|
'interview-formats',
|
||||||
'picking-a-language',
|
'self-introduction',
|
||||||
'study-and-practice',
|
{
|
||||||
'best-practice-questions',
|
type: 'category',
|
||||||
'during-coding-interview',
|
label: 'Coding Round',
|
||||||
'cheatsheet',
|
items: [
|
||||||
'coding-signals',
|
'coding-round-overview',
|
||||||
'mock-interviews',
|
'picking-a-language',
|
||||||
'interviewer-cheatsheet',
|
'study-and-practice',
|
||||||
],
|
'best-practice-questions',
|
||||||
},
|
'during-coding-interview',
|
||||||
'system-design',
|
'cheatsheet',
|
||||||
{
|
'coding-signals',
|
||||||
type: 'category',
|
'mock-interviews',
|
||||||
label: 'Behavioral Round',
|
'interviewer-cheatsheet',
|
||||||
items: [
|
],
|
||||||
'behavioral-round-overview',
|
},
|
||||||
'star-format',
|
'system-design',
|
||||||
'behavioral-questions',
|
{
|
||||||
'psychological-tricks',
|
type: 'category',
|
||||||
],
|
label: 'Behavioral Round',
|
||||||
},
|
items: [
|
||||||
'questions-to-ask',
|
'behavioral-round-overview',
|
||||||
],
|
'star-format',
|
||||||
'Post Interview': [
|
'behavioral-questions',
|
||||||
'understanding-compensation',
|
'psychological-tricks',
|
||||||
'negotiation',
|
],
|
||||||
'engineering-levels',
|
},
|
||||||
'team-selection',
|
'questions-to-ask',
|
||||||
],
|
{
|
||||||
Algorithms: [
|
type: 'category',
|
||||||
'algorithms/algorithms-introduction',
|
label: 'Post Interview',
|
||||||
'algorithms/array',
|
items: [
|
||||||
'algorithms/binary',
|
'understanding-compensation',
|
||||||
'algorithms/dynamic-programming',
|
'negotiation',
|
||||||
'algorithms/geometry',
|
'engineering-levels',
|
||||||
'algorithms/graph',
|
'team-selection',
|
||||||
'algorithms/hash-table',
|
],
|
||||||
'algorithms/heap',
|
},
|
||||||
'algorithms/interval',
|
],
|
||||||
'algorithms/linked-list',
|
},
|
||||||
'algorithms/math',
|
{
|
||||||
'algorithms/matrix',
|
type: 'category',
|
||||||
'algorithms/oop',
|
label: 'Algorithms',
|
||||||
'algorithms/permutation',
|
items: [
|
||||||
'algorithms/queue',
|
'algorithms/algorithms-introduction',
|
||||||
'algorithms/recursion',
|
'algorithms/array',
|
||||||
'algorithms/sorting-searching',
|
'algorithms/binary',
|
||||||
'algorithms/stack',
|
'algorithms/dynamic-programming',
|
||||||
'algorithms/string',
|
'algorithms/geometry',
|
||||||
'algorithms/tree',
|
'algorithms/graph',
|
||||||
'algorithms/trie',
|
'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',
|
||||||
|
],
|
||||||
|
},
|
||||||
|
],
|
||||||
};
|
};
|
||||||
|
Loading…
Reference in new issue